An M^[X]/G^{(1, K)}/1 queue with unreliable server and Bernoulli vacation
by P. Nagarajan; R. Kalyanaraman
International Journal of Mathematics in Operational Research (IJMOR), Vol. 25, No. 4, 2023

Abstract: A Poisson arrival queue with batch arrival, service in a batch of variable size with a minimum of '1' and a maximum of 'K' customers is considered. After completion of service to the customers the server takes on Bernoulli vacation, also during the service of customers the server may breakdown. The supplementary variable technique is applied. The probability generating function of number of customers in the queue at different server states, mean queue size, and probability of server being idle are obtained. Some particular models are deduced. The amenability of the numerical treatment of this study is carried out. The numerical results are given in the form of tables and figures.

Online publication date: Fri, 11-Aug-2023

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 Mathematics in Operational Research (IJMOR):
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