A heuristic rule for routing customers to parallel servers

Statistica Neerlandica

Volumn 51, Issue 1, 1997, Pages 107-121

  Sassen, S A E ^a   Tijms, H C ^b   Nobel, R D ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Controlled queues; Decomposition approach; Markov decision algorithm

Indexed keywords

EID: 0031540011     PISSN: 00390402     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9574.00040     Document Type: Article

References (11)

1. COMBÉ, M. B. and O. J. BOXMA (1994), Optimization of static traffic allocation policies, Theoretical Computer Science A 125, 17-43.
2. HORDIJK, A., G. M. KOOLE and J. A. LOEVE (1994), Analysis of a customer assignment model with no state information, Probability in the Engineering and Informational Sciences 8, 419-429.
3. KRISHNAN, K. R. and T. J. OTT (1986), State-dependent routing for telephone traffic: theory and results, Proceedings IEEE Conference on Decision and Control, 2124-2128.
4. KRISHNAN, K. R. (1987), Joining the right queue: a Markov decision rule, Proceedings IEEE Conference on Decision and Control, 1863-1868.
5. NOBEL, R. D. and H. C. TIJMS (1992), Optimal routing of customers to parallel service groups, in: W. Bühler (ed.), 19th Operations Research Proceedings, Springer-Verlag, Berlin, 173-180.
6. NORMAN, J. M. (1972), Heuristic procedures in dynamic programming, Manchester University Press, Manchester.
7. PUTERMAN, M. L. (1994) Markov decision processes, Wiley, New York.
8. TIJMS, H. C. (1994) Stochastic models: an algorithmic approach, Wiley, Chichester.
9. WEBER, R. R. (1978) On the optimal assignment of customers to parallel servers, Journal of Applied Probability 15, 406-413.
10. WHITT, W. (1986), Deciding which queue to join: some counterexamples, Operations Research 34, 55-62.
11. WINSTON, W. (1977), Optimality of the shortest line discipline, Journal of Applied Probability 14, 181-189.