Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance
暂无分享,去创建一个
John N. Tsitsiklis | Ioannis Ch. Paschalidis | Dimitris Bertsimas | J. Tsitsiklis | D. Bertsimas | I. Paschalidis
[1] G. Klimov. Time-Sharing Service Systems. I , 1975 .
[2] G. J. Foschini,et al. A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..
[3] J. Gittins. Bandit processes and dynamic allocation indices , 1979 .
[4] Erol Gelenbe,et al. Analysis and Synthesis of Computer Systems , 1980 .
[5] Guy Pujolle,et al. Introduction to queueing networks , 1987 .
[6] J. Ben Atkinson,et al. An Introduction to Queueing Networks , 1988 .
[7] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[8] Gideon Weiss,et al. Branching Bandit Processes , 1988, Probability in the Engineering and Informational Sciences.
[9] Awi Federgruen,et al. Characterization and Optimization of Achievable Performance in General Queueing Systems , 1988, Oper. Res..
[10] Lawrence M. Wein,et al. Scheduling networks of queues: Heavy traffic analysis of a simple open network , 1989, Queueing Syst. Theory Appl..
[11] David D. Yao,et al. Optimal dynamic scheduling in Jackson networks , 1989 .
[12] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs , 1990, Oper. Res..
[13] Lawrence M. Wein,et al. Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..
[14] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..
[15] P. R. Kumar,et al. Real Time Scheduling of Manufacturing Systems , 1990 .
[16] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[17] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs , 2011, Oper. Res..
[18] Farid Alizadeh,et al. Combinatorial Optimization with Semi-Definite Matrices , 1992, IPCO.
[19] Leonidas Georgiadis,et al. Extended Polymatroids: Properties and Optimization , 1992, Conference on Integer Programming and Combinatorial Optimization.
[20] David D. Yao,et al. Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..
[21] J. Ou,et al. Performance Bounds for Scheduling Queueing Networks , 1992 .
[22] F. P. Kelly,et al. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling , 1993, Queueing Syst. Theory Appl..
[23] P. R. Kumar,et al. Re-entrant lines , 1993, Queueing Syst. Theory Appl..
[24] Ioannis Ch. Paschalidis. Scheduling of multiclass queueing networks : bounds on achievable performance , 1993 .
[25] Dimitris Bertsimas,et al. Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems , 2011, IPCO.
[26] Hong Chen,et al. Control and scheduling in a two-station queueing network: Optimal policies and heuristics , 1994, Queueing Syst. Theory Appl..
[27] P. R. Kumar,et al. Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..
[28] Sean P. Meyn,et al. Stability of Generalized Jackson Networks , 1994 .