Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-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–389Crossref, Google Scholar
• Bertsimas D., Niño-Mora J. Restless bandits, linear programming relaxations and a primal-dual heuristic. Oper. Res. (1994) . (to appear)Google Scholar
• Bertsimas D., Niño-Mora J. Conservation laws, extended polymatroids and multiarmed bandit problems; A polyhedral approach to indexable systems. Math. Oper. Res. (1996) 21:257–306Link, Google Scholar
• Bertsimas D., Niño-Mora J. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case. Math. Oper. Res. (1999) 24this issueGoogle 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–75Crossref, 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–2075Crossref, Google Scholar
• Bertsimas D., Xu H. Optimization of polling systems and dynamic vehicle routing problems on networks. (1993) . Working paper, Operations Research Center, MITGoogle Scholar
• Boxma O. J. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Syst. (1989) 5:185–214Crossref, Google Scholar
• Burke P. J. The output of a queueing system. Oper. Res. (1956) 4:699–704Link, 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–821Link, Google Scholar
• Finch P. D. On the distribution of queue size in queueing problems. Acta Math. Hungar. (1959) 10:327–336Crossref, Google Scholar
• Fuhrmann S. W., Cooper R. B. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. (1985) 33:1117–1129Link, Google Scholar
• Gelenbe E., Mitrani I.Analysis and Synthesis of Computer Systems (1980) (Academic Press, London) Google Scholar
• Kelly F. P.Reversibility and Stochastic Networks (1979) (Wiley, New York) Google Scholar
• Klimov G. P. Time sharing service systems I. Theory Probab. Appl. (1974) 19:532–551Crossref, Google Scholar
• Klimov G. P. Time sharing service systems II. Theory Probab. Appl. (1978) 23:314–321Crossref, Google Scholar
• Kumar P. R., Meyn S. P. Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies. IEEE Trans. Automat. Control (1996) 41:4–16Crossref, Google Scholar
• Kumar S., Kumar P. R. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automat. Control (1994) 39:1600–1611Crossref, Google Scholar
• Levy H., Sidi M. Polling systems: Applications, modeling, and optimization. IEEE Trans. Comm. (1990) 38:1750–1760Crossref, Google Scholar
• Lovász L., Schrijver A. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. (1991) 1:166–190Crossref, 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, MITGoogle Scholar
• Papadimitriou C. H., Tsitsiklis J. N. The complexity of optimal queueing network control. (1993) . Working paper LIDS 2241, MITGoogle Scholar
• Papangelou F. Integrability of expected increments and a related random change of time scale. Trans. Amer. Math. Soc. (1972) 165:483–506Crossref, Google Scholar
• Shanthikumar J. G., Yao D. D. Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. (1992) 40:S293–299Link, Google Scholar
• Vandenberghe L., Boyd S. Semidefinite programming. SIAM Rev. (1996) 38:49–95Crossref, Google Scholar
• Wein L. M. Scheduling networks of queues: Heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. (1990) 38:1065–1078Link, Google Scholar