Fluid models of sequencing problems in open queueing networks; an optimal control approach

[1]  M. Pullan.  An algorithm for a class of continuous linear programs , 1993 .

[2]  Hong Chen,et al.  Dynamic Scheduling Control for a Network of Queues , 1993 .

[3]  F. P. Kelly,et al.  Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling , 1993, Queueing Syst. Theory Appl..

[4]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs , 2011, Oper. Res..

[5]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[6]  J. Ou,et al.  Performance Bounds for Scheduling Queueing Networks , 1992 .

[7]  Lawrence M. Wein,et al.  Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..

[8]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[9]  Lawrence M. Wein,et al.  Scheduling networks of queues: Heavy traffic analysis of a simple open network , 1989, Queueing Syst. Theory Appl..

[10]  Janusz Filipiak,et al.  Modelling and control of dynamic flows in communication networks , 1988, Communications and control engineering series.

[11]  E. Anderson,et al.  Some Properties of a Class of Continuous Linear Programs , 1983 .

[12]  A. Segall,et al.  An optimal control approach to dynamic routing in networks , 1982 .

[13]  Knut Sydsæter,et al.  SUFFICIENT CONDITIONS IN OPTIMAL CONTROL THEORY , 1977 .

[14]  Adrian Segall,et al.  The Modeling of Adaptive Routing in Data-Communication Networks , 1977, IEEE Trans. Commun..