The achievable region approach to the optimal control of stochastic systems

Journal of the Royal Statistical Society. Series B: Statistical Methodology

Volumn 61, Issue 4, 1999, Pages 747-791

  Dacre, Marcus ^c   Glazebrook, Kevin ^b   Niño Mora, José ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

^c NONE

Author keywords

Achievable region; Gittins index; Linear programming; Load balancing; Multiclass queuing systems; Performance space; Stochastic optimization; Threshold policy

Indexed keywords

EID: 0033477162     PISSN: 13697412     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9868.00202     Document Type: Article

References (42)

1. Atkins, D. and Chen, H. (1995) Performance evaluation of scheduling control of queueing networks: fluid model heuristics. Queueing Syst., 21, 391-413.
2. Bertsekas, D. P. (1995) Nonlinear Programming. Belmont: Athena Scientific.
3. Bertsimas, D. (1995) The achievable region method in the optimal control of queueing systems - formulations, bounds and policies. Queueing Syst., 21, 337-389.
4. Bertsimas, D. and 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.
5. Bertsimas, D., Paschalidis, I. C. and Tsitsiklis, J. N. (1995) Branching bandits and Klimov's problem: achievable region and side constraints. IEEE Trans. Autom. Control, 40, 2063-2075.
6. Chang, C. S. and Yao, D. D. (1993) Rearrangement, majorization and stochastic scheduling. Math. Oper. Res., 18, 658-684.
7. Chen, H. and Yao, D. D. (1990) Optimal intensity control of a queueing system with state-dependent capacity limit, IEEE Trans. Autom. Control, 35, 459-464.
8. Coffman, E. and Mitrani, I. (1980) A characterization of waiting time performance realizable by single server queues. Oper. Res., 28, 810-821.
9. Dacre, M. J. and Glazebrook, K. D. (1999) An approach to load balancing in distributed systems. To be published.
10. Federgruen, A. and Groenevelt, H. (1988) Characterisation and optimisation of achievable performance in queueing systems. Oper. Res., 36, 733-741.
11. Garbe, R. and Glazebrook, K. D. (1998a) Submodular returns and greedy heuristics for queueing scheduling problems. Oper. Res., 46, 336-346.
12. -(1998b) Stochastic scheduling with priority classes. Math. Oper. Res., 23, 119-144.
13. Gelenbe, E. and Mitrani, I. (1980) Analysis and Synthesis of Computer Systems. London: Academic Press.
14. Gelenbe, E. and Pekergin, F. (1993) Load balancing pragmatics. Technical Report. Université René Descartes.
15. Gittins, J. C. (1979) Bandit processes and dynamic allocation indices (with discussion). J. R. Statist. Soc. B, 41, 148-177.
16. -(1989) Multi-armed Bandit Allocation Indices. New York: Wiley.
17. Glasserman, P. and Yao, D. D. (1994) Monotone optimal control of permutable GSMPs. Math. Oper. Res., 19, 449-476.
18. Glazebrook, K. D. (1982) On a sufficient condition for superprocesses due to Whittle. J. Appl. Probab., 19, 99-110.
19. Glazebrook, K. D. and Garbe, R. (1999) Almost optimal policies for stochastic systems which almost satisfy conservation laws. Ann. Oper. Res., to be published.
20. Glazebrook, K. D. and Niño-Mora, J. (1997) Scheduling multi-class queueing networks on parallel servers: approximate and heavy traffic optimality of Klimov's rule. Lect. Notes Comput. Sci., 1284, 232-245.
21. Harrison, J. M. (1996) The BIGSTEP approach to flow management in stochastic processing networks. In Stochastic Networks: Theory and Applications (eds F. Kelly, S. Zachary and I. Ziedens), pp. 57-90. Oxford: Oxford University Press.
22. Harrison, J. M. and Nguyen, V. (1993) Brownian models of multiclass queueing networks: current status and open problems. Queueing Syst. Theory Applic., 13, 5-40.
23. Harrison, J. M. and Wein, L. (1989) Scheduling networks of queues: heavy traffic analysis of a simple open network. Queueing Syst., 5, 265-280.
24. Klimov, G. P. (1974) Time sharing systems I. Theory Probab. Applic., 19, 532-551.
25. Liu, Z. and Towsley, D. (1994) Optimality of the round-robin routing policy. J. Appl. Probab., 31, 466-478.
26. Maglaras, C. (1997) Design of dynamic control policies for stochastic processing networks via fluid models. In Proc. CDC97. New York: Institute of Electrical and Electronic Engineers. To be published.
27. Manne, A. (1960) Linear programming and sequential decisions. Mangmnt Sci., 6, 259-267.
28. Niño-Mora, J. (1998) On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: a linear programming approach. Economics Working Paper 276. Universitat Pompeu Fabra, Barcelona.
29. Ross, K. W. and Yao, D. D. (1991) Optimal load balancing and scheduling in a distributed computer system. J. Ass. Comput. Mach., 38, 676-690.
30. Shanthikumar, J. G. and Yao, D. D. (1992) Multi-class queueing systems: polymatroidal structure and optimal scheduling control. Oper. Res., 40, 293-299.
31. Tantawi, A. N. and Towsley, D. (1984) A general model for optimal static load balancing in star network configurations. In Performance '84, pp. 277-291.
32. -(1985) Optimal static load balancing in distributed computer systems. J. Ass. Comput. Mach., 32, 445-465.
33. Walrand, J. (1988) An Introduction to Queueing Networks. Englewood Cliffs: Prentice Hall.
34. Weber, R. R. (1978) On the optimal assignment of customers to parallel queues. J. Appl. Probab., 15, 406-413.
35. -(1992) On the Gittins index for multi-armed bandits. Ann. Appl. Probab., 2, 1024-1033.
36. Weber, R. R. and Weiss, G. (1990) On an index policy for restless bandits. J. Appl. Probab., 27, 637-648.
37. Weiss, G. (1988) Branching bandit processes. Probab. Engng Inform. Sci., 2, 269-278.
38. -(1992) Turnpike optimality of Smith's rule in parallel machine stochastic scheduling. Math. Oper. Res., 17, 255-270.
39. -(1995) On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines. Adv. Appl. Probab., 27, 821-839.
40. Whittle, P. (1980) Multi-armed bandits and the Gittins index. J. R. Statist. Soc. B, 42, 143-149.
41. -(1988) Restless bandits; activity allocation in a changing world. J. Appl. Probab. A, 25, 287-298.
42. Yao, D. D. and Schechner, Z. (1989) Decentralized control of service rates in a closed Jackson network. IEEE Trans. Autom. Control, 34, 236-240.