Time-Dependent Solution of the Many-Server Poisson Queue

Thomas L. Saaty
Additional contact information
Thomas L. Saaty: Office of Naval Research, Washington, D. C.

Operations Research, 1960, vol. 8, issue 6, 755-772

Abstract: In this paper we obtain the Laplace transform of the transient probabilities of the ordered queuing problem, with Poisson inputs, multiple channels, and exponential service times. Explicit expressions are derived for the two-channel case and known equilibrium conditions are shown to hold. The proof proceeds in two stages. The first obtains the Laplace transform of the generating function of the system and the second solves a first order linear partial differential equation in a restricted generating function introduced to determine the Laplace transform of the probability functions appearing in the first generating function. In the two-channel case the solution is decomposed into two components, one of which is immediately related to the well-known solution of the single-channel queue. We also study the problem with different service distributions for the two-channel case and compute the distribution of a busy period for that case.

Date: 1960
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.6.755 (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:8:y:1960:i:6:p:755-772

Access Statistics for this article

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