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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.