Abstract
We argue the importance of problems concerning the dynamic routing of tasks for service in environments where the servers have diverse characteristics and are subject to breakdown. We propose a general model in which both service times and repair times at each machine are i.i.d.with some general distribution. Routing decisions take account of queue lengths, machine states (up or down), the elapsed processing times of jobs in service and the times to date of any machine repairs in progress. We develop an approach to machine calibration which yields a machine index which is a function of all of the preceding information. The heuristic which routes all tasks to the machine of current smallest index performs outstandingly well. The approach of the paper is flexible and is capable of yielding strongly performing routing policies for a range of variants of the basic model. These include cases where job processing is lost at each breakdown and where the machine state may be only partially observed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.S. Ansell, K.D. Glazebrook, and C. Kirkbride, Generalised “join the shortest queue” policies for the dynamic routing of jobs to multiclass queues. J. Oper. Res. Soc. 54 (2003) 379–389.
P.S. Ansell, K.D. Glazebrook, J. Niño-Mora, and M. O'Keeffe, Whittle's index policy for a multi-class queueing system with convex holding costs. Math. Meth. Oper. Res. 57 (2003) 21–39.
K.D. Glazebrook and C. Kirkbride, Index policies for the routing of background jobs. Nav. Res. Logist. 51 (2004) 856–872.
A. Hordijk and G. Koole, On the optimality of the generalised shortest queue policy. Prob. Eng. Inf. Sci. 4 (1990) 477–487.
G. Koole, P.D. Sparaggis, and D. Towsley, Minimising response times and queue lengths in systems of parallel queues. J. Appl. Prob. 36 (1999) 1185–1193.
K.R. Krishnan, Joining the right queue: A Markov decision rule. In: Proceedings of the 28th IEEE Conference Decision Control, (1987) 1863–1868.
S.P. Martin, I. Mitrani, and K.D. Glazebrook, Dynamic routing among several intermittently available servers. In: Proceedings of the 1st EuroNGI Conference on Next Generation Internet Networks, (2005) 1–8.
B. Menich and R. Serfozo, Optimality of routing and servicing in dependent parallel processing systems. Queueing Systems 9 (1991) 403–418.
I. Mitrani and P.E. Wright, Routing in the presence of breakdowns. Performance Evaluation 20 (1994) 151–164.
J. Niño-Mora, Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach. Math. Prog. 93 (2002) 361–413.
M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley, New York, 1994).
N. Thomas and I. Mitrani, Routing among different nodes where servers break down without losing jobs. In Proceedings of the IPDS 95, Erlangen (1995).
H.C. Tijms, Stochastic Models: An algorithmic approach (Wiley, Chichester, 1994).
R.R. Weber, On the optimal assignment of customers to parallel queues. J. Appl. Prob. 15 (1978) 406–413.
P. Whittle, Restless bandits: Activity allocation in a changing world. J. Appl. Prob. A25 (1988) 287–298.
P. Whittle, Optimal Control: Basics and beyond (Wiley, New York, 1996).
W. Winston, Optimality of the shortest line discipline. J. Appl. Prob. 14 (1977) 181–189.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS Subject Classifications 49L20, 90B22
Rights and permissions
About this article
Cite this article
Glazebrook, K.D., Kirkbride, C. Dynamic routing to heterogeneous collections of unreliable servers. Queueing Syst 55, 9–25 (2007). https://doi.org/10.1007/s11134-006-9002-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-006-9002-9