Maximum entropy approach for an unreliable MX/G/1 queueing system with Bernoulli vacation, restricted admission and delayed phase repair under N-policy Online publication date: Wed, 09-Mar-2016
by Madhu Jain; G.C. Sharma; Varsha Rani
International Journal of Services and Operations Management (IJSOM), Vol. 23, No. 4, 2016
Abstract: The present article deals with a bulk arrival queueing model with an unreliable server and modified Bernoulli vacation under N-policy. The repairman who restores the server requires a setup time before starting his job. The repair to the failed server is provided in K-phases where first phase of repair is essential and remaining (K-1) phases are optional. The service time, vacation time, setup time and repair time of each phase are assumed to be independent and general distributed. The queue size distribution and other performance indices are obtained by employing the generating function and supplementary variable techniques. Further, the principle of maximum entropy is used to derive the approximate formulae for the waiting time of the customers. We perform the sensitivity analysis in order to observe the effects of different system parameters on various performance indices.
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 Services and Operations Management (IJSOM):
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