Sequential Arrays of Waiting Lines

Gordon C. Hunt
Additional contact information
Gordon C. Hunt: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1956, vol. 4, issue 6, 674-683

Abstract: The problem considered in this paper is that in which a sequence of service operations must be performed on the units to be serviced. Poisson arrivals and exponential service times are assumed. Four particular cases of service facilities in series are treated, involving infinite storage space between stages, no storage space between stages, finite storage space between stages, and the case of the unpaced belt-production line. A comparison is given for two stages, and the maximum possible utilization is obtained for all cases discussed.

Date: 1956
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.4.6.674 (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:4:y:1956:i:6:p:674-683

Access Statistics for this article

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