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

P. Vijaya Laxmi and Obsie Mussa Yesuf

International Journal of Mathematics in Operational Research, 2011, vol. 3, issue 2, 219-243

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. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=38912 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:3:y:2011:i:2:p:219-243

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().