On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times

Lajos Takács
Additional contact information
Lajos Takács: Case Western Reserve University, Cleveland, Ohio

Operations Research, 1976, vol. 24, issue 3, 564-571

Abstract: We consider a single-server queue with Poisson input and general service times and determine the following probabilities: the probability that a busy period has length ≦ x and the maximal queue size during the busy period is ≦ k , and the probability that a busy period has length ≦ x and the maximal virtual waiting time during the busy period is ≦ y .

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.3.564 (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:24:y:1976:i:3:p:564-571

Access Statistics for this article

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