A study on MX/GB/1 retrial queueing system with Bernoulli vacation schedule and variable server capacity Online publication date: Thu, 28-Sep-2017
by S. Sasikala; K. Indhira; V.M. Chandrasekaran
International Journal of Knowledge Management in Tourism and Hospitality (IJKMTH), Vol. 1, No. 3, 2017
Abstract: In this paper, we have investigated bulk retrial queueing system with Bernoulli vacation schedule and variable server capacity. According to the variable server capacity bulk service rule, the server can serve a minimum of one customer and a maximum of B customers in a batch. After completion of a batch of service, if the orbit is empty, then the server will go for a vacation. After completion of each batch of service, if the orbit is non-empty, then the server either go for a vacation with probability p or resumes its service with probability p. If arriving customers finds the server is busy with service or on vacation, they are grouped and it termed as unsatisfied customers or orbit. Unsatisfied customers will retry its appeal for service after some time. We have presented steady state system equations for the proposed model. Also, we have obtained some important performance measures for this system. Further, we have given numerical justification for this queueing system.
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 Knowledge Management in Tourism and Hospitality (IJKMTH):
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