The analysis of a finite-buffer general input queue with batch arrival and exponential multiple vacations Online publication date: Fri, 07-Dec-2007
by K. Sikdar, U.C. Gupta, R.K. Sharma
International Journal of Operational Research (IJOR), Vol. 3, No. 1/2, 2008
Abstract: Vacation queueing models have wide range of application in several areas including computer-communication, and manufacturing systems. A finite-buffer single-server queue with renewal input and multiple exponential vacations has been analysed by Karaesmen and Gupta (1996). In this paper we extend the analysis to cover the batch arrivals, i.e. we consider a batch arrival single-server queue with renewal input and multiple exponential vacations. Using the imbedded Markov chain and supplementary variable techniques we obtain steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs. The Laplace-Stieltjes transforms of the actual waiting-time distribution of the first-, arbitrary- and last-customer of a batch under First-Come-First-Serve discipline have been derived. Finally, we present useful performance measures of interest such as probability of blocking, average queue (system) length. Some tables and graphs showing the effect of model parameters on key performance measures are presented.
Online publication date: Fri, 07-Dec-2007
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:
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 email@example.com