IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v54y2000i2p148-159.html
   My bibliography  Save this article

Optimal static customer routing in a closed queuing network

Author

Listed:
  • A. Hordijk
  • J. A. Loeve

Abstract

In this paper we analyse the routing of customers in a general closed queuing network which satisfies a product‐form assumption. We prove that there are optimal deterministic routing rules, and we provide an algorithm to compute a Nash equilibrium point of the stochastic game in which the players are the customers. Constrained optimal routing rules are also considered.

Suggested Citation

  • A. Hordijk & J. A. Loeve, 2000. "Optimal static customer routing in a closed queuing network," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 54(2), pages 148-159, July.
    • Handle: RePEc:bla:stanee:v:54:y:2000:i:2:p:148-159
    DOI: 10.1111/1467-9574.00133
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/1467-9574.00133
    Download Restriction: no
    File URL: https://libkey.io/10.1111/1467-9574.00133?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. 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. Michelle Opp & Kevin Glazebrook & Vidyadhar G. Kulkarni, 2005. "Outsourcing warranty repairs: Dynamic allocation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 381-398, August.

    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:bla:stanee:v:54:y:2000:i:2:p:148-159. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    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.