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

A heuristic rule for routing customers to parallel servers

Author

Listed:
  • S. A. E. Sassen
  • H. C. Tijms
  • R. D. Nobel

Abstract

A practically important problem is the assignment of stochastically arriving service requests to one of several parallel service groups so as to minimize the long‐run average sojourn time per service request. An exact solution of this multi‐dimensional optimization problem is computationally infeasible. A simple heuristic solution method yielding a good suboptimal rule will be given for the case of server groups with different and generally distributed service times. This solution method is based on a decomposition approach and first principles from Markov decision theory. The main idea of the heuristic method is to apply one step of policy improvement to the best Bernoulli‐splitting rule.

Suggested Citation

  • S. A. E. Sassen & H. C. Tijms & R. D. Nobel, 1997. "A heuristic rule for routing customers to parallel servers," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 51(1), pages 107-121, March.
    • Handle: RePEc:bla:stanee:v:51:y:1997:i:1:p:107-121
    DOI: 10.1111/1467-9574.00040
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/1467-9574.00040
    Download Restriction: no
    File URL: https://libkey.io/10.1111/1467-9574.00040?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. Rob Shone & Vincent A. Knight & Paul R. Harper, 2020. "A conservative index heuristic for routing problems with multiple heterogeneous service facilities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 511-543, December.
    2. I. Adan & O. Boxma, 2007. "Comments on: Dynamic priority allocation via restless bandit marginal productivity indices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 199-201, December.
    3. Coolen, F. P. A. & Coolen-Schrijner, P., 2003. "A nonparametric predictive method for queues," European Journal of Operational Research, Elsevier, vol. 145(2), pages 425-442, March.
    4. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.

    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:51:y:1997:i:1:p:107-121. 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.