The Distribution of the Maximum Length of a Poisson Queue During a Busy Period

Marcel F. Neuts
Additional contact information
Marcel F. Neuts: Division of Mathematical Sciences, Purdue University, Lafayette, Indiana

Operations Research, 1964, vol. 12, issue 2, 281-285

Abstract: In the design of waiting facilities for the customers in a queue, it is of interest to know probability distributions of extremal values of the queue length. In this paper we propose to calculate explicitly the probability that \documentclass{aastex}\usepackage{amsbsy}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{bm}\usepackage{mathrsfs}\usepackage{pifont}\usepackage{stmaryrd}\usepackage{textcomp}\usepackage{portland,xspace}\usepackage{amsmath,amsxtra}\pagestyle{empty}\DeclareMathSizes{10}{9}{7}{6}\begin{document}$$0 for all t in [0, t ), in which Z t denotes the queue length at time t . This is the probability that in a Poisson queue the server remains busy throughout the time interval [0, t ) without ever having as many as b customers in line. We express this probability in terms of the taboo-probabilities with taboo-states 0 and b for a finite continuous time random walk. As an incidental result we obtain new expressions for these taboo-probabilities. It is routine to determine the distribution of the maximum queue length before the next emptiness from our results.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.2.281 (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:12:y:1964:i:2:p:281-285

Access Statistics for this article

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