Conservation laws for single-server fluid networks

DOI10.1023/A:1010906331066MaRDI QIDQ5938466zbMATH OpenOpenAlexFDO

Authors Nicole Bäuerle, Shaler jun. Stidham

Publication date 19 July 2001

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010906331066

zbMATH Keywords

achievable-region approachconservation lawsfluid networkGittins indexlinear program

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal control of single-server fluid networks
• On the structure of the optimal server control for fluid networks
• Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule
• Sample-path conservation laws, with applications to scheduling queues and fluid systems
• Optimal control of queueing networks: an approach via fluid models

Cited in

(4)

• Optimal control of single-server fluid networks
• Control of patient flow in emergency departments, or multiclass queues with deadlines and feedback
• Convex stochastic fluid programs with average cost.
• Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule

This page was built for publication: Conservation laws for single-server fluid networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938466)