Dynamic routing to heterogeneous collections of unreliable servers

Queueing Systems

Volumn 55, Issue 1, 2007, Pages 9-25

  Glazebrook, K D ^a,b   Kirkbride, C ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Dynamic programming; Dynamic routing; Index policy; Lagrangian relaxation; Machine breakdowns; Policy improvement; Semi Markov decision process

Indexed keywords

MARKOV PROCESSES; TURING MACHINES;

DYNAMIC ROUTING; INDEX POLICIES; LAGRANGIAN RELAXATION; MACHINE BREAKDOWN; SEMI-MARKOV DECISION PROCESS;

DYNAMIC PROGRAMMING;

EID: 33846376782     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-006-9002-9     Document Type: Article

References (17)

1. 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.
2. 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.
3. K.D. Glazebrook and C. Kirkbride, Index policies for the routing of background jobs. Nav. Res. Logist. 51 (2004) 856-872.
4. A. Hordijk and G. Koole, On the optimality of the generalised shortest queue policy. Prob. Eng. Inf. Sci. 4 (1990) 477-487.
5. 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.
6. K.R. Krishnan, Joining the right queue: A Markov decision rule. In: Proceedings of the 28th IEEE Conference Decision Control, (1987) 1863-1868.
7. 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.
8. B. Menich and R. Serfozo, Optimality of routing and servicing in dependent parallel processing systems. Queueing Systems 9 (1991) 403-418.
9. I. Mitrani and P.E. Wright, Routing in the presence of breakdowns. Performance Evaluation 20 (1994) 151-164.
10. J. Niño-Mora, Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach. Math. Prog. 93 (2002) 361-413.
11. M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley, New York, 1994).
12. N. Thomas and I. Mitrani, Routing among different nodes where servers break down without losing jobs. In: Proceedings of the IPDS 95, Erlangen (1995).
13. H.C. Tijms, Stochastic Models: An algorithmic approach (Wiley, Chichester, 1994).
14. R.R. Weber, On the optimal assignment of customers to parallel queues. J. Appl. Prob. 15 (1978) 406-413.
15. P. Whittle, Restless bandits: Activity allocation in a changing world. J. Appl. Prob. A25 (1988) 287-298.
16. P. Whittle, Optimal Control: Basics and beyond (Wiley, New York, 1996).
17. W. Winston, Optimality of the shortest line discipline. J. Appl. Prob. 14 (1977) 181-189.