An M[X]/G(a, b)/1 queueing system with unreliable server, stand-by server, restricted arrivals and variant threshold policy for vacations Online publication date: Thu, 15-Jul-2021
by G. Ayyappan; S. Karpagam
International Journal of Operational Research (IJOR), Vol. 41, No. 3, 2021
Abstract: We studied the behaviour of an M[X]/G(a, b)/1 queueing system with unreliable server, stand-by server, restricted admissibility and variant threshold policy for vacations in this paper. The stand-by server is utilised only during main server's repair period. At the moment of main server's busy completion or repair completion, if the number of customers in the queue is less than 'a', the main server avails type-I vacation repeatedly until the queue length reaches at least 'a'. While getting back from vacation of type-I, if the queue has its length of value as at least 'a' then the server performs the type-II vacation continuously, until it reaches at least N(a < b ≤ N). When both types of vacation gets completed, and the length queue is at least 'N', then the server starts service to the batch of 'b' customers. The PGF of queue size and some important performance measures are derived. An extensive numerical result is illustrated.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook