Optimal repairable M^X/G/1 queue with Bernoulli feedback and setup
by M. Jain; Shweta Upadhyaya
International Journal of Mathematics in Operational Research (IJMOR), Vol. 4, No. 6, 2012

Abstract: We consider an MX/G/1 queue with Bernoulli feedback under N-policy. According to N-policy, the server starts the service only if N customers are accumulated in the system. The server undergoes breakdown during the busy state, which is then repaired by the repairman in k number of phases. Both the server and the repairman take start-up and set-up times, respectively. Using the supplementary variable technique and the generating function method, we establish the stationary distribution of the queue length and various other queueing characteristics. Using the maximum entropy approach. We determine the approximate results for the steady-state probability distributions of the queue length and the waiting time of an arbitrary customer in the queue.

Online publication date: Tue, 23-Dec-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com