An algorithm for minimum wait draining of two-station fluid re-entrant line

DOI10.1023/A:1018907403413zbMath0958.90008OpenAlexW3988575MaRDI QIDQ1960311

Gideon Weiss

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

zbMATH Keywords

schedulingpolynomial time algorithmfluid approximationcontinuous linear programmingre-entrant linecontrol of multiclass queueing networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) (H^infty)-control (93B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Asymptotic optimality of tracking policies in stochastic networks. ⋮ Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ Fluid analysis of an input control problem ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks

This page was built for publication: An algorithm for minimum wait draining of two-station fluid re-entrant line