IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v8y1960i2p246-253.html
   My bibliography  Save this article

Finite Queues and Cyclic Queues

Author

Listed:
  • Ernest Koenigsberg

    (Touche, Ross, Bailey & Smart, San Francisco, California)

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.].

Suggested Citation

  • Ernest Koenigsberg, 1960. "Finite Queues and Cyclic Queues," Operations Research, INFORMS, vol. 8(2), pages 246-253, April.
  • Handle: RePEc:inm:oropre:v:8:y:1960:i:2:p:246-253
    DOI: 10.1287/opre.8.2.246
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.8.2.246
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.8.2.246?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ta, Chung H. & Ingolfsson, Armann & Doucette, John, 2013. "A linear model for surface mining haul truck allocation incorporating shovel idle probabilities," European Journal of Operational Research, Elsevier, vol. 231(3), pages 770-778.
    2. Gary E. Horne & Telba Z. Irony, 1994. "Queueing processes and trade‐offs during ship‐to‐shore transfer of cargo," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(2), pages 137-151, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:8:y:1960:i:2:p:246-253. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.