The Probability Law of the Busy Period for Two Types of Queuing Processes

Lajos Takács
Additional contact information
Lajos Takács: Columbia University, New York, New York

Operations Research, 1961, vol. 9, issue 3, 402-407

Abstract: A simple combinatorial method is given for the determination of the joint distribution of the length of the busy period and the number of customers served during this period for two types of single-Berver queuing processes. (1) Customers arrive at a counter according to a Poisson process and the service times have a general distribution, (2) customers arrive at a counter according to a recurrent process and the service times have an exponential distribution.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.3.402 (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:9:y:1961:i:3:p:402-407

Access Statistics for this article

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