Target-pursuing scheduling and routing policies for multiclass queueing networks

IEEE Transactions on Automatic Control

Volumn 49, Issue 10, 2004, Pages 1709-1722

  Paschalidis, Ioannis Ch ^a   Su, Chang ^a   Caramanis, Michael C ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; ROUTERS; SCHEDULING; SENSOR DATA FUSION; SYSTEM STABILITY;

FLUID MODELS; MULTICLASS QUEUEING NETWORKS; SENSOR NETWORKS;

QUEUEING NETWORKS;

EID: 7244254151     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2004.835389     Document Type: Article

References (27)

1. D. Bertsimas, I. C. Paschalidis, and J. N. Tsitsiklis, " Optimization of multiclass queueing networks: polyhedral and nonlinear characterizations of achievable performance," Ann. Appl. Probab., vol. 4, no. 1, pp. 43-75, 1994.
2. C. H. Papadimitriou and J. N. Tsitsiklis, "The complexity of optimal queueing network control," Math. Oper. Res., vol. 24, no. 2, pp. 293-305, 1999.
3. J. M. Harrison and L. M. Wein, "Scheduling networks of queues: Heavy traffic analysis of a simple open network," Queueing Syst. Theory Applicat., vol. 5, pp. 265-280, 1989.
4. J. M. Harrison, "Brownian models of queueing networks with heterogeneous customer populations," in Stochastic Differential Systems, Stochastic Control Theory and Applications, W. Fleming and P. L. Lions, Eds. New York: Springer-Verlag, 1988, vol. 10, pp. 147-186.
5. S. Kumar and P. R. Kumar, "Performance bounds for queueing networks and scheduling policies," IEEE Trans. Automat. Contr., vol. 39, pp. 1600-1611, Aug. 1994.
6. D. Bertsimas, I. C. Paschalidis, and J. N. Tsitsiklis, "Branching bandits and Klimov's problem: achievable region and side constraints," IEEE Trans. Automat. Contr., vol. 40, pp. 2063-2075, Dec. 1995.
7. J. G. Dai, "On the positive Harris recurrence for multiclass queueing networks: a unified approach via fluid models," Ann. Appl. Probab., vol. 5, pp. 49-77, 1995.
8. S. Lu, D. Ramaswamy, and P. R. Kumar, "Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants," IEEE Trans. Semiconductor Manufact., vol. 7, pp. 374-385, Mar. 1994.
9. S. P. Meyn, "Sequencing and routing in multiclass queueing networks. Part I: feedback regulation," SIAM J. Control Optim., vol. 40, no. 3, pp. 741-776, 2001.
10. C. Maglaras, "Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality," Ann. Appl. Probab., vol. 10, no. 3, pp. 897-929, 2000.
11. N. Baeuerle, "Asymptotic optimality of tracking-policies in stochastic networks," Ann. App. Probab., no. 10, pp. 1065-1083, 2000.
12. S. Henderson, S. P. Meyn, and V. Tadic, "Performance evaluation and policy selection in multiclass networks," Discrete Event Dyna. Syst., pp. 149-189, 2003.
13. S. P. Meyn, "Sequencing and routing in multiclass queueing networks. Part II: workload relaxations," SIAM J. Control Optim., vol. 42, no. 1, pp. 178-217, 2003.
14. S. Kumar and P. R. Kumar, "Closed queueing networks in heavy traffic: Fluid limits and efficiency," in Stochastic Networks: Stability and Rare Events, P. Glasserman, K. Sigman, and D. Yao, Eds. New York: Springer-Verlag, 1996, vol. 117, pp. 41-64.
15. J. Kimemia and S. B. Gershwin, "An algorithm for the computer control of a flexible manufacturing system," IIE Trans., vol. 15. no. 4, pp. 353-362, 1983.
16. G. J. Van Ryzin, S. Lou, and S. B. Gershwin, "Production control for a tandem two-machine system," IIE Trans., vol. 25, no. 5, pp. 5-20, 1993.
17. J. R. Perkins and P. R. Kumar, "Buffer level control of unreliable manufacturing systems," in Proc. Amer. Control Conf., vol. 1, 1992, pp. 826-827.
18. G. Liberopoulos and M. Caramanis, "Dynamics and design of a class of parameterized manufacturing flow controllers," IEEE Trans. Automat. Contr., vol. 40, pp. 1018-1028, June 1995.
19. J. Hu and M. Caramanis, "Dynamic set-up scheduling of flexible manufacturing systems: design and stability of near optimal general round robin policies," in Discrete Event Systems, Manufacturing Systems, and Communication Networks, P. R. Kumar and P. Varaiya, Eds. New York: Springer-Verlag, 1995, vol. 73, pp. 73-104.
20. J. G. Dai, "Stability of fluid and stochastic processing networks," Georgia Inst. Technol., Atlanta, GA, Tech. Rep., 1998.
21. S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability. New York: Springer-Verlag, 1993.
22. P. Billingsley, Probability and Measure, 3rd ed. New York: Wiley, 1995.
23. F. Vazquez-Abad, C. Cassandras, and V. Julka, "Centralized and decentralized asynchronous optimization of stochastic discrete-event systems," IEEE Trans. Automat. Contr., vol. 43, pp. 631-655, May 1998.
24. P. Marbach and J. Tsitsiklis, "Simulation-based optimization of Markov reward processes," IEEE Trans. Automat. Contr., vol. 46, pp. 191-209, Feb. 2001.
25. P. R. Kumar and T. I. Seidman, "Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems," IEEE Trans. Automat. Contr., vol. 35, pp. 289-298, Mar. 1990.
26. A. N. Rybko and A. L. Stolyar, "Ergodicity of stochastic processes describing the operation of an open queueing network," Problemy Peredachi Informatsii, vol. 28, no. 3, pp. 3-26, 1992.
27. J. Walrand, An Introduction to Queueing Networks. Upper Saddle River, NJ: Prentice-Hall, 1988.