IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v31y1985i4p475-487.html
   My bibliography  Save this article

The Best Order for Queues in Series

Author

Listed:
  • Ward Whitt

    (AT&T Bell Laboratories, Holmdel, New Jersey 07733)

Abstract

An important design problem for queueing systems is to determine the best order for two or more service stations in series. For given external arrival process and given service-time distributions, the object is to determine the order of the stations (to be used by all customers) that minimizes the expected equilibrium sojourn time per customer. Unfortunately, very little is known about this problem because exact analysis is extremely difficult. This paper applies approximation methods recently developed for networks of queues to obtain approximation formulas and useful heuristic design principles.

Suggested Citation

  • Ward Whitt, 1985. "The Best Order for Queues in Series," Management Science, INFORMS, vol. 31(4), pages 475-487, April.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:4:p:475-487
    DOI: 10.1287/mnsc.31.4.475
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.4.475
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.4.475?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. van den Hout, W.B., 1996. "The power-series algorithm : A numerical approach to Markov processes," Other publications TiSEM ad00ca29-7daf-4bdb-b994-c, Tilburg University, School of Economics and Management.
    2. Ward Whitt, 1999. "Partitioning Customers into Service Groups," Management Science, INFORMS, vol. 45(11), pages 1579-1592, November.
    3. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    4. Noa Zychlinski & Avishai Mandelbaum & Petar Momčilović, 2018. "Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 15-47, June.
    5. Benjamin Avi-Itzhak & Hanoch Levy, 2001. "Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 358-374, May.
    6. Subba Rao, S. & Gunasekaran, A. & Goyal, S. K. & Martikainen, T., 1998. "Waiting line model applications in manufacturing," International Journal of Production Economics, Elsevier, vol. 54(1), pages 1-28, January.
    7. van den Hout, W.B. & Blanc, J.P.C., 1994. "The power-series algorithm for Markovian queueing networks," Discussion Paper 1994-67, Tilburg University, Center for Economic Research.

    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:ormnsc:v:31:y:1985:i:4:p:475-487. 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.