Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room

John H. Rath and Diane Sheng
Additional contact information
John H. Rath: Bell Laboratories, Holmdel, New Jersey
Diane Sheng: Stanford University, Stanford, California

Operations Research, 1979, vol. 27, issue 6, 1208-1216

Abstract: We report in this note a study of the use of the interrupted Poisson process (IPP) as an approximation to the overflow process from a M / M / C / K queue (a queue with a Poisson arrival process, C servers each with exponentially distributed service times, and a maximum of K customers in the system). The IPP has been used successfully by Kuczura to approximate the overflow from a M / M / C / C queue. Numerical comparisons are made for a number of examples and both the maximum absolute errors and percent errors are plotted.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.6.1208 (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:27:y:1979:i:6:p:1208-1216

Access Statistics for this article

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