Index policies for the routing of background jobs

Naval Research Logistics

Volumn 51, Issue 6, 2004, Pages 856-872

  Glazebrook, K D ^a   Kirkbride, C ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Dynamic programming; Index policies; Queues; Restless bandits; Routing

Indexed keywords

COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC PROGRAMMING; NUMERICAL ANALYSIS; QUEUEING THEORY; ROUTERS;

INDEX POLICIES; QUEUES; RESTLESS BANDITS; ROUTING;

JOB ANALYSIS;

EID: 4444264655     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.20034     Document Type: Article

References (28)

1. P.S. Ansell, K.D. Glazebrook, J. Niño-Mora, and M. O'Keefe, Whittle's index policy for a multi-class queueing system with convex holding costs, Math Methods Oper Res 57 (2003), 21-39.
2. D. Bertsimas and J. Niño-Mora, Conservation laws, extended polymatroids and multi-armed bandit problems: A unified approach to indexable systems, Math Oper Res 21 (1996), 257-306.
3. C.S. Chang, A new ordering for stochastic majorization: Theory and applications, Adv Appl Probab 24 (1992), 604-634.
4. M.J. Dacre, K.D. Glazebrook, and J. Niño-Mora, The achievable region approach to the optimal control of stochastic systems (with discussion), J R Statist Soc Ser B Stat Methodol 61 (1999), 747-791.
5. A. Ephremides, P. Varaiya, and J. Walrand, A simple dynamic routing problem, IEEE Trans Automat Control AC-25 (1980), 690-693.
6. J.C. Gittins, Bandit processes and dynamic allocation indices (with discussion), J R Statist Soc Ser B Stat Methodol 41 (1979), 148-177.
7. J.C. Gittins, Multi-armed bandit allocation indices, Wiley, Chichester, 1989.
8. K.D. Glazebrook and H. Mitchell, An index policy for a stochastic scheduling model with improving/deteriorating jobs, Naval Res Logist 49 (2002), 706-721.
9. K.D. Glazebrook, P.S. Ansell, and C. Kirkbride, Generalised "join the shortest queue" policies for the dynamic routing of jobs to multi-class queues, J Oper Res Soc 54 (2003), 379-389.
10. A. Hordijk and G. Koole, On the optimality of the generalized shortest queue policy, Probab Engrg Inform Sci 4 (1990), 477-487.
11. G.P. Klimov, Time sharing systems I, Theory Probab Appl 19 (1974), 532-551.
12. G. Koole, On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers, Math Oper Res 21 (1996), 469-476.
13. G. Koole, P.D. Sparaggis, and D. Towsley, Minimizing response times and queue lengths in systems of parallel queues, J Appl Probab 36 (1999), 1185-1193.
14. K.R. Krishnan, Joining the right queue: A Markov decision rule, Proc 28th IEEE Conf Decision Control, 1987, pp. 1863-1868.
15. Z. Liu and R. Righter, Optimal load balancing on distributed homogeneous unreliable processors, Oper Res 46 (1998), 563-573.
16. Z. Liu and D. Towsley, Optimality of the round-robin policy, J Appl Probab 31 (1994), 466-478.
17. J. Niño-Mora, Restless bandits, partial conservation laws and indexability, Adv Appl Probab 33 (2001), 76-98.
18. J. Niño-Mora, Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach, Math Program 93 (2002), 361-413.
19. C.H. Papadimitriou and J.N. Tsitsiklis, The complexity of optimal queueing network control, Math Oper Res 24 (1999), 293-305.
20. M.L. Puterman, Markov decision processes: Discrete stochastic dynamic programming, Wiley, New York, 1994.
21. K.W. Ross and D.D. Yao, Optimal load balancing and scheduling in a distributed computer system, J ACM 38 (1991), 676-690.
22. H.C. Tijms, Stochastic models: An algorithmic approach, Wiley, Chichester, 1994.
23. R.R. Weber, On the optimal assignment of customers to parallel queues, J Appl Probab 15 (1978), 406-413.
24. R.R. Weber and G. Weiss, On an index policy for restless bandits, J Appl Probab 27 (1990), 637-648.
25. R.R. Weber and G. Weiss, Addendum to "On and index policy for restless bandits," Adv Appl Probab 23 (1991), 429-430.
26. P. Whittle, Restless bandits: Activity allocation in a changing world, J Appl Probab A25 (1988), 287-298.
27. P. Whittle, Optimal control: Basics and beyond, Wiley, New York, 1996.
28. W. Winston, Optimality of the shortest line discipline, J Appl Probab 14 (1977), 181-189.