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

Mathematics of Operations Research

Volumn 24, Issue 2, 1999, Pages 306-330

  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; DIFFERENTIATION (CALCULUS); MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; QUEUEING NETWORKS; SCHEDULING;

MULTICLASS QUEUEING NETWORKS; PALM CALCULUS;

OPTIMIZATION;

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

References (35)

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. To appear in Oper. Res.
4. _, _. 1996. Conservation laws, extended polymatroids and multi-armed 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 II, the multiple-station case. Math. Oper. Res. 24(2).
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. _. 1995. Static optimization of queueing systems. R. P. Agarwal, ed., Recent Trends in Optimization Theory and Applications, World Scientific Publishing.
11. _, H. Levy, J. A. Weststrate. 1991. Efficient visit frequencies for polling tables: Minimization of waiting cost. Queueing Syst. 9 133-162.
12. Burke, P. J. 1956. The output of a queueing system. Oper. Res. 4 699-704.
13. Buzacott, J. A., J. G. Shanthikumar. 1993. Stochastic Models of Manufacturing Systems. Prentice Hall, Englewood Cliffs, NJ.
14. Coffman, E. G., Jr., I. Mitrani. 1980. A characterization of waiting time performance realizable by single server queues. Oper. Res. 28 810-821.
15. Cooper, R. B., G. Murray. 1969. Queues served in cyclic order. Bell Syst. Tech. J. 48 675-689.
16. Eisenberg, M. 1972. Queues with periodic service and changeover time. Oper. Res. 20 440-451.
17. Federgruen, A., H. Groenevelt. 1988. Characterization and optimization of achievable performance in general queueing systems. Oper. Res. 36 733-741.
18. Fuhrmann, S. W., R. B. Cooper. 1985. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. 33 1117-1129.
19. Gelenbe, E., I. Mitrani. 1980. Analysis and Synthesis of Computer Systems. Academic Press, London.
20. Gupta, D., J. A. Buzacott. 1990. A production system with two job classes, changeover times and revisitation. Queueing Syst. 6 353-368.
21. Kelly, F. P. 1979. Reversibility and Stochastic Networks, Wiley, New York.
22. Kleinrock, L., H. Levy. 1988. The analysis of random polling systems. Oper. Res. 36 716-732.
23. Klimov, G. P. 1974. Time sharing service systems I. Theory Probab. Appl. 19 532-551.
24. Kumar, S., P. R. Kumar. 1994. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Autom. Control 39 1600-1611.
25. Levy, H., M. Sidi. 1990. Polling systems: Applications, modeling, and optimization. IEEE Trans. Comm. 38 1750-1760.
26. Lovász, L., A. Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 166-190.
27. 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.
28. Papadimitriou, C. H., J. N. Tsitsiklis. 1994. The complexity of optimal queueing network control. Working Paper LIDS 2241, MIT.
29. Papangelou, F. 1972. Integrability of expected increments and a related random change of time scale. Trans. Amer. Math. Soc. 165 483-506.
30. Reiman, M. I., L. M. Wein. 1994. Dynamic scheduling of a two-class queue with setups. Working paper, Sloan School of Management, MIT.
31. Shanthikumar, J. G., D. D. Yao. 1992. Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. 40 S293-299.
32. Sidi, M., H. Levy, S. W. Fuhrmann. 1992. A queueing network with a single cyclically roving server. Queueing Syst. 10 121-144.
33. Takagi, H. 1986. Analysis of polling systems. MIT Press, Cambridge, MA.
34. Tsoucas, P. 1991. The region of achievable performance in a model of Klimov. Research Report RC16543, IBM T.J. Watson Research Center, Yorktown Heights, NY.
35. Vandenberghe, L., S. Boyd. 1996. Semidefinite programming. SIAM Review 38 49-95.