Title: Renewal input infinite buffer batch service queue with single exponential working vacation and accessibility to batches

Authors: P. Vijaya Laxmi, Obsie Mussa Yesuf

Addresses: Department of Applied Mathematics, Andhra University, Visakhapatnam, 530 003, Andhra Pradesh, India. ' Department of Mathematics, Andhra University, Visakhapatnam, 530 003, Andhra Pradesh, India

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.

Keywords: batch accessibility; non-accessible batches; supplementary variables; batch service queues; single vacation; working vacation; infinite buffer.

DOI: 10.1504/IJMOR.2011.038912

International Journal of Mathematics in Operational Research, 2011 Vol.3 No.2, pp.219 - 243

Available online: 06 Mar 2011

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