Binomial schedule for an M/G/1 queueing system with an unreliable server
by Omar M. Ba-Rukab; Lotfi Tadj; Jau-Chuan Ke
International Journal of Modelling in Operations Management (IJMOM), Vol. 3, No. 3/4, 2013

Abstract: We consider in this paper a queueing system where, at a service completion epoch, the server decides to serve the next customer or take a vacation, to perform some auxiliary work. If a vacation is taken, the server again has to decide, at the end of the vacation, whether to take another one. This process continues for a maximum of K vacations. We call this a binomial schedule. We further assume that the server is unreliable and may break down anytime while providing service. Analysis of this system yields to the explicit expression of the optimal number of vacations K^*. Numerical illustrations are provided.

Online publication date: Wed, 29-Jan-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 Modelling in Operations Management (IJMOM):
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