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

Observing Queues Before Joining

Author

Listed:
  • M. Hlynka

    (University of Windsor, Windsor, Ontario, Canada)

  • D. A. Stanford

    (University of Western Ontario, London, Ontario, Canada)

  • W. H. Poon

    (University of Windsor, Windsor, Ontario, Canada)

  • T. Wang

    (University of Alberta, Edmonton, Alberta, Canada)

Abstract

We consider a queueing system with two servers, each with its own queue. The interarrival times are generally distributed. The service time for each server is exponentially distributed but the rates may be different. No jockeying between the two queues is allowed. We consider situations in which a smart customer can delay joining a queue until some arrivals or service departures have been observed. All other customers join the shortest queue. We find conditions under which the smart customer can lower its expected sojourn time in the system by waiting and observing rather than immediately joining the shortest queue.

Suggested Citation

  • M. Hlynka & D. A. Stanford & W. H. Poon & T. Wang, 1994. "Observing Queues Before Joining," Operations Research, INFORMS, vol. 42(2), pages 365-371, April.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:2:p:365-371
    DOI: 10.1287/opre.42.2.365
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.2.365
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.2.365?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. Vasco F. Alves, 2021. "Endogenous queue number determination in G/M/s systems," 4OR, Springer, vol. 19(1), pages 113-126, March.
    2. Brill, P. H. & Hlynka, M., 2000. "An exponential queue with competition for service," European Journal of Operational Research, Elsevier, vol. 126(3), pages 587-602, November.

    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:42:y:1994:i:2:p:365-371. 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.