An algorithm for minimum wait draining of two-station fluid re-entrant line
From MaRDI portal
Publication:1960311
DOI10.1023/A:1018907403413zbMath0958.90008MaRDI QIDQ1960311
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018907403413
scheduling; polynomial time algorithm; fluid approximation; continuous linear programming; re-entrant line; control of multiclass queueing networks
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
93B36: (H^infty)-control
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks, Fluid analysis of an input control problem, Asymptotic optimality of tracking policies in stochastic networks., Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.