Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, the multi-station case

Mathematics of Operations Research

Volumn 24, Issue 2, 1999, Pages 331-361

  Bertsimas, Dimitris ^a   Niño Mora, José ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b DEPARTMENT OF ECONOMICS AND BUSINESS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; QUEUEING NETWORKS; SCHEDULING;

MULTICLASS QUEUEING NETWORKS; PRIORITY INDEX POLICY;

OPTIMIZATION;

EID: 0344146620     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.2.331     Document Type: Article

References (28)

1. Baccelli, F., P. Brémaud. 1994. Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences. Springer-Verlag, Berlin.
2. Bertsimas, D. 1995. The achievable region method in the optimal control of queueing systems; formulations, bounds and policies. Queueing Syst. and Appl. 21 337-389.
3. _, J. Niño-Mora. 1994. Restless bandits, linear programming relaxations and a primal-dual heuristic. Oper. Res. (to appear).
4. _, _. 1996. Conservation laws, extended polymatroids and multiarmed bandit problems; A polyhedral approach to indexable systems. Math. Oper. Res. 21 257-306.
5. _, _. 1999. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case. Math. Oper. Res. 24, this issue.
6. _, I. Paschalidis, J. Tsitsiklis. 1994. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Ann. Appl. Probab. 4 43-75.
7. _, _, _. 1995. Branching bandits and Klimov's problem: Achievable region and side constraints. IEEE Trans. Automat. Control 40 2063-2075.
8. _, H. Xu. 1993. Optimization of polling systems and dynamic vehicle routing problems on networks. Working paper, Operations Research Center, MIT.
9. Boxma, O. J. 1989. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Syst. 5 185-214.
10. Burke, P. J. 1956. The output of a queueing system. Oper. Res. 4 699-704.
11. Buzacott, J. A., J. G. Shanthikumar. 1993. Stochastic Models of Manufacturing Systems. Prentice Hall, Englewood Cliffs, NJ.
12. Coffman, E. G., Jr., I. Mitrani. 1980. A characterization of waiting time performance realizable by single server queues. Oper. Res. 28 810-821.
13. Finch, P. D. 1959. On the distribution of queue size in queueing problems. Acta Math. Hungar. 10 327-336.
14. Fuhrmann, S. W., R. B. Cooper. 1985. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. 33 1117-1129.
15. Gelenbe, E., I. Mitrani. 1980. Analysis and Synthesis of Computer Systems. Academic Press, London.
16. Kelly, F. P. 1979. Reversibility and Stochastic Networks. Wiley, New York.
17. Klimov, G. P. 1974. Time sharing service systems I. Theory Probab. Appl. 19 532-551.
18. _. 1978. Time sharing service systems II. Theory Probab. Appl. 23 314-321.
19. Kumar, P. R., S. P. Meyn. 1996. Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies. IEEE Trans. Automat. Control 41 4-16.
20. Kumar, S., P. R. Kumar. 1994. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automat. Control 39 1600-1611.
21. Levy, H., M. Sidi. 1990. Polling systems: Applications, modeling, and optimization. IEEE Trans. Comm. 38 1750-1760.
22. Lovász, L., A. Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 166-190.
23. Niño-Mora, J. 1995. Optimal Resource Allocation in a Dynamic and Stochastic Environment: A Mathematical Programming Approach. PhD Dissertation, Sloan School of Management, MIT.
24. Papadimitriou, C. H., J. N. Tsitsiklis. 1993. The complexity of optimal queueing network control. Working Paper LIDS 2241, MIT.
25. Papangelou, F. 1972. Integrability of expected increments and a related random change of time scale. Trans. Amer. Math. Soc. 165 483-506.
26. Shanthikumar, J. G., D. D. Yao. 1992. Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. 40 S293-299.
27. Vandenberghe, L., S. Boyd. 1996. Semidefinite programming. SIAM Review 38 49-95.
28. Wein, L. M. 1990. Scheduling networks of queues: Heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 38 1065-1078.