Stationary Single-Server Queuing Processes with a Finite Number of Sources

Gerald Harrison
Additional contact information
Gerald Harrison: The Teleregister Corporation, Stamford, Connecticut

Operations Research, 1959, vol. 7, issue 4, 458-467

Abstract: Some basic relations are obtained that apply to finite single-server stationary queuing processes. These relations depend only on the mean service time and mean source idle time and not on the form of the distributions. When the source idle time follows a negative exponential distribution, the service time distribution being arbitrary, the length of the waiting line at instants of completion of service is a Markov chain. Its distribution as well as the waiting-time distribution is obtained. The results are specialized to the cases of negative exponential and constant service times.

Date: 1959
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.7.4.458 (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:7:y:1959:i:4:p:458-467

Access Statistics for this article

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