Analysis of an M/M/N queue with Bernoulli service schedule
by B. Krishna Kumar, S. Pavai Madheswari
International Journal of Operational Research (IJOR), Vol. 5, No. 1, 2009

Abstract: In this paper, a Markovian multiple server queue in which each server takes vacation according to Bernoulli scheduling service has been studied. For this system, the stationary queue length distribution and several performance characteristics are obtained using the matrix geometric solution technique. The system busy period and waiting time distribution have been discussed. The 1-limited service and exhaustive service with multiple vacations have been analysed as special cases. Extensive numerical illustrations are provided.

Online publication date: Wed, 08-Apr-2009

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