On an M^[X]/G/1 queuing system with random breakdowns, server vacations, delay times and a standby server
by Rehab F. Khalaf; Kailash C. Madan; Cormac A. Lucas
International Journal of Operational Research (IJOR), Vol. 15, No. 1, 2012

Abstract: In this work, we study a batch arrival queue with a Bernoulli schedule vacation where after every service completion the server may take a vacation of random length with probability p or may stay in the system providing service with probability 1 − p. Moreover, we assume that the server may breakdown randomly, and the repair process does not start immediately after a breakdown; consequently, there is a delay time waiting for repairs to start. The main new contribution in this work is that we assume that the system is equipped with a standby server to serve the costumers during the vacation period of the main server. The service times, vacation times, repair times and delay times are assumed to follow different general arbitrary distributions while the service times of the standby server follows an exponential distribution.

Online publication date: Sun, 11-Jan-2015

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 Operational Research (IJOR):
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