The Busy Period of a Queue with Batch Service

M. F. Neuts
Additional contact information
M. F. Neuts: Purdue University, Lafayette, Indiana

Operations Research, 1965, vol. 13, issue 5, 815-819

Abstract: In this paper, we study the distribution of the busy period for a queue with Poisson input, in which the customers are served m at the time if there are m or more present and all at once if there are less than m present. We show that the busy period is equal to the time between successive visits to the state 0 in an imbedded semi-Markov process, associated with the queuing process. Extending an argument of L. Takács for the M / G /1 queue, we obtain the transform of the distribution of the busy period. Explicit expressions in real time may in principle be obtained, using Lagrange's expansion.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.5.815 (application/pdf)

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:inm:oropre:v:13:y:1965:i:5:p:815-819

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().