Title: A batch service queueing system with multiple vacations, setup time and server's choice of admitting reservice

Authors: M. Haridass; R. Arumuganathan

Addresses: Department of Mathematics and Computer Applications, PSG College of Technology, Coimbatore 641 004, Tamil Nadu, India ' Department of Mathematics and Computer Applications, PSG College of Technology, Coimbatore 641 004, Tamil Nadu, India

Abstract: In this paper, a bulk queueing system with server's choice of admitting reservice, multiple vacations and setup time is considered. At a service completion, the leaving batch may request for reservice with probability π and it is not mandatory to accept it; the server admits this request with a probability α. After the reservice or service completion without request for reservice, if the queue length is less than a, the server leaves for a vacation of random length. After this vacation, if the queue length is still less than 'a', the server leaves for another vacation, etc., until he finally finds at least 'a' customers waiting for service. At a vacation completion epoch, if the server finds at least 'a' customers waiting for service, he requires a setup time to start the service. After a setup time or on service completion or on reservice completion, if the server finds at least 'a' customers waiting for service say, ξ, he serves a batch of min (ξ, b) customers, where b ≥ a . The probability generating function of the queue size is obtained. Various performance measures are derived. A cost model is developed.

Keywords: bulk queues; multiple vacations; setup times; admitting reservice; batch service queueing; performance measures; cost modelling.

DOI: 10.1504/IJOR.2012.046646

International Journal of Operational Research, 2012 Vol.14 No.2, pp.156 - 186

Available online: 13 Apr 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article