Whittle's index policy for a multi-class queueing system with convex holding costs

Mathematical Methods of Operations Research

Volumn 57, Issue 1, 2003, Pages 21-39

  Ansell, P S ^a   Glazebrook, K D ^b   Nino Mora J ^c   O'Keeffe, M ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c DEPARTMENT OF ECONOMICS AND BUSINESS   (Spain)

Author keywords

Achievable region approach; Dynamic programming; Index policy; Indexability; Restless bandit

Indexed keywords

ACHIEVABLE REGION APPROACH; INDEX POLICY; INDEXABILITY; RESTLESS BANDIT;

ALGORITHMS; COMPUTER SOFTWARE; COSTS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; SERVERS;

QUEUEING THEORY;

EID: 2442525727     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s001860200257     Document Type: Article

References (23)

1. Ansell PS, Glazebrook KD, Mitrani I (2001) Threshold policies for a single-server queueing network. Prob. Eng. Inf. Sci. 15:15-33
2. Ansell PS, Glazebrook KD, Mitrani I, Niño-Mora J (1999) A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints. J. Oper. Res. Soc. 50:765-773
3. Bertsimas D, Niño-Mora J (1996) Conservation laws, extended polymatroids and multi-armed bandit problems: a polyhedral approach to indexable systems. Math. Oper. Res. 21:257-306
4. Blanc JPC (1993) Performance analysis and optimisation with the Power Series Algorithm. Lecture Notes in Computer Science 729:55-80, Springer-Verlag
5. Cobham A (1954) Priority assignment in waiting line problems. Oper. Res. 2:70-76
6. Cox DR, Smith WL (1961) Queues. Methuen, London
7. Dacre M, Glazebrook KD, Niño-Mora J (1999) The achievable region approach to the optimal control of stochastic systems (with discussion). J. Roy. Statist. Soc. B61:747-791
8. Gittins JC (1979) Bandit processes and dynamic allocation indices (with discussion). J. R. Statist. Soc. B41:148-177
9. Harrison JM (1975) Dynamic scheduling of a multiclass queue: discount optimality. Oper. Res. 23:270-282
10. Klimov GP (1974) Time sharing service systems I. Theory Prob. Appl. 19:532-551
11. Kojima M (1994) A primitive interior point algorithm for semidefinite programs. In Mathematica, Research Report #293, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan
12. Meilijson I, Weiss G (1977) Multiple feedback at a single-server station. Stoch. Proc. Appl. 5:195-205
13. Niño-Mora J (2001a) Restless bandits, partial conservation laws and indexability. Adv. Appl. Prob. 33:76-98
14. Niño-Mora J (2001b) 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
15. Puterman ML (1994) Markov decision processes: Discrete stochastic dynamic programming. Wiley, New York
16. Righter R, Xu SH (1991) Scheduling jobs on nonidentical IFR processors to minimize general cost functions. Adv. Appl. Prob. 23:909-924
17. Tijms H (1994) Stochastic models, an algorithmic approach. Wiley, New York
18. van Meighem JA (1995) Dynamic scheduling with convex delay costs: the generalized cμ-rule. Ann. Appl. Prob. 5:809-833
19. Weber RR (1988) Stochastic scheduling on parallel processors and minimization of concave functions of completion times. In "Stochastic differential systems, stochastic control theory and applications." IMA Vol. Math. Appl. 10:601-609, Springer-Verlag
20. Weber RR, Weiss G (1990) On an index policy for restless bandits. J. Appl. Prob. 27:637-648
21. Weber RR, Weiss G (1991) Addendum to "On an index policy for restless bandits". Adv. Appl. Prob. 23:429-430
22. Weiss G (1988) Branching bandit processes. Prob. Eng. Inf. Sci. 2:269-278
23. Whittle P (1988) Restless bandits: activity allocation in a changing world. J. Appl. Prob. A25:287-298