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

Queuing With Fixed and Variable Channels

Author

Listed:
  • Joseph J. Moder

    (School of Industrial Engineering, Georgia Institute of Technology, Atlanta, Georgia)

  • Cecil R. Phillips

    (Operations Research Incorporated, Silver Spring, Maryland)

Abstract

The process treated in this paper is one in which the number of service channels is limited and the queue is unlimited. Arrivals and services are under steady-state conditions and exponentially distributed. Arrivals form in a single queue under strict queue discipline. The number of manned channels increases from a fixed minimum number, (sigma), when the queue reaches a given length N . When the maximum number of channels S , ( S > (sigma)) are operating, no further increases are possible and the queue is unbounded. Channels are cancelled when the number of units in the queue drops to v ( O (le) v (le) N - 2) and a service is completed. Seven model equations describing the process are solved, giving explicit expressions for the state probabilities. The usual measures of effectiveness are developed, together with a new measure appropriate to this model, i.e., the mean number of channel starts per unit time. Sample computations are made on the measures of effectiveness, indicating their sensitivity to the parameters and their application to various problems.

Suggested Citation

  • Joseph J. Moder & Cecil R. Phillips, 1962. "Queuing With Fixed and Variable Channels," Operations Research, INFORMS, vol. 10(2), pages 218-231, April.
    • Handle: RePEc:inm:oropre:v:10:y:1962:i:2:p:218-231
    DOI: 10.1287/opre.10.2.218
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.10.2.218
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.10.2.218?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. Michael Rubinovitch, 1983. "The Slow Server Problem," Discussion Papers 571, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Berman, Oded & Wang, Jiamin & Sapna, K. P., 2005. "Optimal management of cross-trained workers in services with negligible switching costs," European Journal of Operational Research, Elsevier, vol. 167(2), pages 349-369, December.

    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:10:y:1962:i:2:p:218-231. 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.