IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v8y1980i1p105-112.html
   My bibliography  Save this article

Transient and steady state results for two parallel queues

Author

Listed:
  • Grassmann, WK

Abstract

This paper lists numerical results for a system with two parallel queues in which arriving customers always join the shorter queue. These results enable us to discuss how fast the expected queue length converges toward its equilibrium, provided the arrivals are below the capacity of the service facility. It also shows how fast the expected queue length increases in case the traffic flow is at or above the capacity of the service facility. Finally, it is shown that the system under consideration behaves very similar to a two-server queue.

Suggested Citation

  • Grassmann, WK, 1980. "Transient and steady state results for two parallel queues," Omega, Elsevier, vol. 8(1), pages 105-112.
    • Handle: RePEc:eee:jomega:v:8:y:1980:i:1:p:105-112
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(80)90046-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Chaithanya Bandi & Dimitris Bertsimas & Nataly Youssef, 2018. "Robust transient analysis of multi-server queueing systems and feed-forward networks," Queueing Systems: Theory and Applications, Springer, vol. 89(3), pages 351-413, August.
    2. Nur Sunar & Yichen Tu & Serhan Ziya, 2021. "Pooled vs. Dedicated Queues when Customers Are Delay-Sensitive," Management Science, INFORMS, vol. 67(6), pages 3785-3802, June.
    3. Zhang, Zhongju & Daigle, John, 2012. "Analysis of job assignment with batch arrivals among heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 217(1), pages 149-161.
    4. B. M. Rao & M. J. M. Posner, 1987. "Algorithmic and approximation analyses of the shorter queue model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 381-398, June.
    5. M. Saxena & I. Dimitriou & S. Kapodistria, 2020. "Analysis of the shortest relay queue policy in a cooperative random access network with collisions," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 39-75, February.
    6. Boronico, Jess S. & Siegel, Philip H., 1998. "Capacity planning for toll roadways incorporating consumer wait time costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 297-310, May.
    7. Chaithanya Bandi & Nikolaos Trichakis & Phebe Vayanos, 2019. "Robust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems," Management Science, INFORMS, vol. 65(1), pages 152-187, January.

    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:eee:jomega:v:8:y:1980:i:1:p:105-112. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.