Finite Queues and Cyclic Queues

Ernest Koenigsberg
Additional contact information
Ernest Koenigsberg: Touche, Ross, Bailey & Smart, San Francisco, California

Operations Research, 1960, vol. 8, issue 2, 246-253

Abstract: The finite queue problem, for which tables exist [Peck, L. G., R. N. Hazelwood. 1958. Finite Queuing Tables . ORSA Publications in Operations Research No. 2. Wiley, New York.], is a special case of the cyclic queue [Koenigsberg, E. 1958. Oper. Res. Quart. 9 22--35]. We consider a closed system with two stages, the first a repair stage and the second an operating stage. There are N machines in the system, of which a maximum of A can be operating or productive at any one time ( A operators). When breakdowns occur at a mean rate (mu) 2 the machines enter the repair stage which has M parallel servers ( M repairmen), who service the machines at a mean rate (mu) 1 . If (mu) 1 and (mu) 2 are defined by an exponential distribution, then the numbers N , A , M , and (mu) 2 /(mu) 1 define the output of the system. When A = N the problem is identical to the Swedish Machine problem for which tables are already available [Peck, L. G., R. N. Hazelwood. 1958. Finite Queuing Tables . ORSA Publications in Operations Research No. 2. Wiley, New York.].

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.2.246 (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:8:y:1960:i:2:p:246-253

Access Statistics for this article

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