Index Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs

Queueing Systems

Volumn 45, Issue 2, 2003, Pages 81-111

  Glazebrook, K D ^a   Lumley, R R ^a   Ansell, P S ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Index policy; Indexability; Restless bandit; Service control; Stochastic dynamic programming

Indexed keywords

STOCHASTIC SYSTEMS;

INDEX POLICIES; INDEXABILITY; RESTLESS BANDIT; SERVICE CONTROL; STOCHASTIC DYNAMIC PROGRAMMING;

DYNAMIC PROGRAMMING;

EID: 1642419524     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1026060405346     Document Type: Article

References (18)

1. E. Altman and P. Nain, Optimal control of the M/G/1 queue with repeated vacations of the server, IEEE Trans. Automat. Control 38 (1993) 1766-1775.
2. P.S. Ansell, K.D. Glazebrook, I. Mitrani and J. Niño Mora, A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints, J. Oper. Res. Soc. 50 (1999) 765-773.
3. P.S. Ansell, K.D. Glazebrook, J. Niño Mora and M. O'Keeffe, Whittle's index policy for a multiclass queueing system with convex holding costs, Math. Methods Oper. Res. (to appear).
4. D. Bertsimas and J. Niño Mora, Conservation laws, extended polymatroids and multi-armed bandit problems: A polyhedral approach to indexable systems, Math. Oper. Res. 21 (1996) 257-306.
5. A. Cobham, Priority assignment in waiting line problems, Oper. Res. 2 (1954) 70-76.
6. D.R. Cox and W.L. Smith, Queues (Methuen, London, 1961).
7. A. Federgruen and K.C. So, Optimality of threshold policies in single-server queueing systems with server vacations, Adv. in Appl. Probab. 23 (1991) 288-405.
8. J.C. Gittins, Multi-Armed Bandit Allocation Indices (Wiley, New York, 1989).
9. J.M. Harrison, Dynamic scheduling of a multiclass queue: discount optimality, Oper. Res. 23 (1975) 270-282.
10. G.P. Klimov, Time sharing systems I, Theory Probab. Appl. 19 (1974) 532-551.
11. J. Niño Mora, Countable partial conservation laws, Whittle's restless bandit index and a dynamic cμ rule for scheduling a multiclass M/M/ 1 queue with convex holding costs, Technical Report, Universitat Pompeu Fabra (2001).
12. M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley, New York, 1994).
13. R. Righter and S.H. Xu, Scheduling jobs on nonindentical IFR processors to minimize general cost functions, Adv. in Appl. Probab. 23 (1991) 909-924.
14. J.A. van Meighem, Dynamic scheduling with convex delay costs: The generalized cμ-rule, Ann. Appl. Probab. 5 (1995) 809-833.
15. R.R. Weber, Stochastic scheduling on parallel processors and minimization of concave functions of completion times, in: Stochastic Differential Systems, Stochastic Control Theory and Applications, Vol. 10 (Springer, Berlin, 1988) pp. 601-609.
16. G. Weiss, Branching bandit processes, Probab. Engrg. Inform. Sci. 2 (1988) 269-278.
17. P. Whittle, Restless bandits: activity allocation in a changing world, J. Appl. Probab. A 25 (1988) 287-298.
18. P. Whittle, Optimal Control: Basics and Beyond (Wiley, Chichester, 1996).