Binomial Schedule for an M/G/1 Type Queueing System with an Unreliable Server under N-Policy. (15th May 2014)

• Record Type: Journal Article
• Authors: Tadj, Lotfi; Yoon, K. Paul
• Other Names: Pardalos Panagote M. Academic Editor.
• Is Part Of: Advances in decision sciences. Volume 2014(2014)
• Publication Date: 2014-05-15
• Subjects: Decision making -- Periodicals; Decision making; Electronic journals; Periodicals; 519
• DOI: 10.1155/2014/819718
• Languages: English
• ISSNs: 2090-3359

Abstract

Abstract : We consider in this paper an M/G/1 type queueing system with the following extensions. First, the server is unreliable and is subject to random breakdowns. Second, the server also implements the well-knownN -policy. Third, instead of a Bernoulli vacation schedule, the more general notion of binomial schedule withK vacations is applied. A cost function with two decision variables is developed. A numerical example shows the effect of the system parameters on the optimal management policy.