Renewal input infinite buffer batch service queue with single exponential working vacation and accessibility to batches Online publication date: Sun, 06-Mar-2011
by P. Vijaya Laxmi, Obsie Mussa Yesuf
International Journal of Mathematics in Operational Research (IJMOR), Vol. 3, No. 2, 2011
Abstract: This paper considers an infinite buffer single server batch service queue with single exponential working vacation policy. The inter-arrival times are generally independent and identically distributed random variables and the service times are exponential. The server accesses new arrivals even after service has started on any batch of initial number a. This operation continues till the service time of the ongoing batch is completed or the maximum accessible limit d of the batch being served is attained whichever occurs first. The supplementary variable technique and the recursive method are used to develop the steady-state queue length distributions at pre-arrival and arbitrary epochs. Some performance measures and numerical results are discussed.
Online publication date: Sun, 06-Mar-2011
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:
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 firstname.lastname@example.org