IDEAS home Printed from
   My bibliography  Save this article

Maximizing throughput in finite-source parallel queue systems


  • Delasay, Mohammad
  • Kolfal, Bora
  • Ingolfsson, Armann


Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are homogeneous, we demonstrate that the Shortest Queue policy is optimal, and when the servers are heterogeneous, we partially characterize the optimal policy and present a near-optimal and simple-to-implement policy. We use the model to illustrate the substantial benefits of pooling, by comparing it to the permanent assignment of customers to servers.

Suggested Citation

  • Delasay, Mohammad & Kolfal, Bora & Ingolfsson, Armann, 2012. "Maximizing throughput in finite-source parallel queue systems," European Journal of Operational Research, Elsevier, vol. 217(3), pages 554-559.
  • Handle: RePEc:eee:ejores:v:217:y:2012:i:3:p:554-559
    DOI: 10.1016/j.ejor.2011.09.041

    Download full text from publisher

    File URL:
    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.

    References listed on IDEAS

    1. Wartenhorst, Pieter, 1995. "N parallel queueing systems with server breakdown and repair," European Journal of Operational Research, Elsevier, vol. 82(2), pages 302-322, April.
    2. Ki Ching, Wai, 2001. "Machine repairing models for production systems," International Journal of Production Economics, Elsevier, vol. 70(3), pages 257-266, April.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. Brooks, James D. & Kar, Koushik & Mendonça, David J., 2016. "Allocation of flows in closed bipartite queueing networks," European Journal of Operational Research, Elsevier, vol. 255(2), pages 333-344.
    2. Zhao, Yaping & Xu, Xiaoyun & Li, Haidong & Liu, Yanni, 2016. "Prioritized customer order scheduling to maximize throughput," European Journal of Operational Research, Elsevier, vol. 255(2), pages 345-356.
    3. 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.


    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:ejores:v:217:y:2012:i:3:p:554-559. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.