Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case

References

• Baccelli F. , Brémaud P. Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences (1994) (Springer-Verlag, Berlin) Google Scholar
• Bertsimas D. The achievable region method in the optimal control of queueing systems; formulations, bounds and policies. Queueing Syst. Appl. (1995) 21 337 389 Crossref, Google Scholar
• Bertsimas D. , Niño-Mora J. Restless bandits, linear programming relaxations and a primal-dual heuristic. Oper. Res. (1994) . To appear in Google Scholar
• Bertsimas D. , Niño-Mora J. Conservation laws, extended polymatroids and multi-armed bandit problems; a polyhedral approach to indexable systems. Math. Oper. Res. (1996) 21 257 306 Link, Google Scholar
• Bertsimas D. , Niño-Mora J. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, the multiple-station case. Math. Oper. Res. (1999) 24 2 Google Scholar
• Bertsimas D. , Paschalidis I. , Tsitsiklis J. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Ann. Appl. Probab. (1994) 4 43 75 Crossref, Google Scholar
• Bertsimas D. , Paschalidis I. , Tsitsiklis J. Branching bandits and Klimov's problem: Achievable region and side constraints. IEEE Trans. Automat. Control (1995) 40 2063 2075 Crossref, Google Scholar
• Bertsimas D. , Xu H. Optimization of polling systems and dynamic vehicle routing problems on networks. (1993) . Working paper, Operations Research Center, MIT Google Scholar
• Boxma O. J. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Syst. (1989) 5 185 214 Crossref, Google Scholar
• Boxma O. J. , Agarwal R. P. Static optimization of queueing systems. Recent Trends in Optimization Theory and Applications (1995) (World Scientific Publishing) Crossref, Google Scholar
• Boxma O. J. , Levy H. , Weststrate J. A. Efficient visit frequencies for polling tables: Minimization of waiting cost. Queueing Syst. (1991) 9 133 162 Crossref, Google Scholar
• Burke P. J. The output of a queueing system. Oper. Res. (1956) 4 699 704 Link, Google Scholar
• Buzacott J. A. , Shanthikumar J. G. Stochastic Models of Manufacturing Systems (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Coffman E. G. , Mitrani I. A characterization of waiting time performance realizable by single server queues. Oper. Res. (1980) 28 810 821 Link, Google Scholar
• Cooper R. B. , Murray G. Queues served in cyclic order. Bell Syst. Tech. J. (1969) 48 675 689 Crossref, Google Scholar
• Eisenberg M. Queues with periodic service and changeover time. Oper. Res. (1972) 20 440 451 Link, Google Scholar
• Federgruen A. , Groenevelt H. Characterization and optimization of achievable performance in general queueing systems. Oper. Res. (1988) 36 733 741 Link, Google Scholar
• Fuhrmann S. W. , Cooper R. B. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. (1985) 33 1117 1129 Link, Google Scholar
• Gelenbe E. , Mitrani I. Analysis and Synthesis of Computer Systems (1980) (Academic Press, London) Google Scholar
• Gupta D. , Buzacott J. A. A production system with two job classes, changeover times and revisitation. Queueing Syst. (1990) 6 353 368 Crossref, Google Scholar
• Kelly F. P. Reversibility and Stochastic Networks (1979) (Wiley, New York) Google Scholar
• Kleinrock L. , Levy H. The analysis of random polling systems. Oper. Res. (1988) 36 716 732 Link, Google Scholar
• Klimov G. P. Time sharing service systems I. Theory Probab. Appl. (1974) 19 532 551 Crossref, Google Scholar
• Kumar S. , Kumar P. R. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Autom. Control (1994) 39 1600 1611 Crossref, Google Scholar
• Levy H. , Sidi M. Polling systems: Applications, modeling, and optimization. IEEE Trans. Comm. (1990) 38 1750 1760 Crossref, Google Scholar
• Lovász L. , Schrijver A. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. (1991) 1 166 190 Crossref, Google Scholar
• Niño-Mora J. Optimal Resource Allocation in a Dynamic and Stochastic Environment: A Mathematical Programming Approach (1995) . Ph.D. Dissertation, Sloan School of Management, MIT Google Scholar
• Papadimitriou C. H. , Tsitsiklis J. N. The complexity of optimal queueing network control. (1994) . Working paper LIDS 2241, MIT Google Scholar
• Papangelou F. Integrability of expected increments and a related random change of time scale. Trans. Amer. Math. Soc. (1972) 165 483 506 Crossref, Google Scholar
• Reiman M. I. , Wein L. M. Dynamic scheduling of a two-class queue with setups. (1994) . Working paper, Sloan School of Management, MIT Google Scholar
• Shanthikumar J. G. , Yao D. D. Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. (1992) 40 S293 299 Link, Google Scholar
• Sidi M. , Levy H. , Fuhrmann S. W. A queueing network with a single cyclically roving server. Queueing Syst. (1992) 10 121 144 Crossref, Google Scholar
• Takagi H. Analysis of Polling Systems (1986) (MIT Press, Cambridge, MA) Google Scholar
• Tsoucas P. The region of achievable performance in a model of Klimov. (1991) . Research report RC16543, IBM T.J. Watson Research Center, Yorktown Heights, NY Google Scholar
• Vandenberghe L. , Boyd S. Semidefinite programming. SIAM Rev. (1996) 38 49 95 Crossref, Google Scholar