A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times

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

Operations Research, 1962, vol. 10, issue 3, 395-399

Abstract: Combinatorial methods are given for the determination of the distribution of the queue size, the waiting time, the number of customers served in a busy period and the length of a busy period for a single-server queuing process with recurrent input and exponentially distributed service times.

Date: 1962
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.3.395 (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:10:y:1962:i:3:p:395-399

Access Statistics for this article

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