Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
First Online: 20 May 2003 Received: 01 November 2001 Accepted: 01 September 2002 DOI:
10.1057/palgrave.jors.2601504 Cite this article as: Ansell, P., Glazebrook, K. & Kirkbride, C. J Oper Res Soc (2003) 54: 379. doi:10.1057/palgrave.jors.2601504 Abstract
Jobs or customers arrive and require service that may be provided at one of several different stations. The associated
routing problems concern how customers may be assigned to stations in an optimal manner. Much of the classical literature concerns a single class of customers seeking service from a collection of homogeneous stations. We argue that many contemporary application areas call for the analysis of routing problems in which many classes of customer seek service provided at a collection of diverse stations. This paper is the first to consider routing policies in such complex environments which take appropriate account of the degree of congestion at each service station. A simple and intuitive class of policies emerges from a policy improvement approach. In a numerical study, the policies were close to optimal in all cases. Keywords dynamic programming heuristics multi-class queues routing scheduling References
Whitt W (1986). Deciding which queue to join: some counter-examples. Opns Res 34: 55–62.
Liu Z and Righter R (1998). Optimal load balancing on distributed homogeneous unreliable processors. Opns Res 46: 563–573.
Koole G (1996). On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers. Math Opns Res 21: 469–476.
Johri PK (1989). Optimality of the shortest line discipline with state dependent service times. Eur J Opl Res 41: 157–161.
Houck DJ (1987). Comparison of policies for routing customers to parallel queueing systems. Opns Res 35: 306–310.
Kleinrock L (2002). Creating a mathematical theory of computer networks. Opns Res 50: 125–131.
Altman E (2000). Applications of Markov decision processes in communication networks: a survey. Rapport de Recherche 3984, INRIA.
Foster I and Kesselman C (eds) (1998). The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufman: San Francisco.
Braun TD, Siegel HJ, and Maciejewski AA. (2001). Heterogeneous computing: goals, methods and open problems. “PDPTA 2001: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, (ed. Arabnia HR), pp 1–12. CSREA: Athens”.
Becker KJ, Gaver DP, Glazebrook KD, Jacobs PA and Lawphongpanich S (2000). Allocation of tasks to specialized processors: a planning approach. Eur J Opl Res 126: 80–88.
Schwartz B (1974). Queueing models with lane selection: a new class of problems. Opns Res 22: 331–339.
Green L (1985). A queueing system with general-use and limited-use servers. Opns Res 33: 168–182.
Ross KW and Yao DD (1991). Optimal load balancing and scheduling in a distributed computer system. J Assoc Comput Mach 38: 676–690.
Dacre MJ, Glazebrook KD and Niño-Mora J (1999). The achievable region approach to the optimal control of stochastic systems (with discussion). J R Stat Soc B 61: 747–791.
Puterman ML (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley: New York.
Krishan KR (1987). Joining the right queue: a Markov decision rule. In: Proceedings of the 28th IEEE Conference on Decision and Control, pp 1863–1868.
Tijms HC (1994). Stochastic Models: an Algorithmic Approach. Wiley: Chichester.
Ansell PS, Dacre MJ, Glazebrook KD and Kirkbride C (2000). Optimal load balancing and scheduling in distributed multi-class service systems. Technical Report, Newcastle University.
Hajek B (1985). Extremal splittings of point processes. Math Opns Res 10: 543–556.
CrossRef Copyright information
© Palgrave Macmillan Ltd 2003