A heuristic rule for routing customers to parallel servers

S. A. E. Sassen, H. C. Tijms and R. D. Nobel

Statistica Neerlandica, 1997, vol. 51, issue 1, 107-121

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.

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1111/1467-9574.00040

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:51:y:1997:i:1:p:107-121

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().