Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
DOI10.1214/aoap/1177004706zbMath0843.90047OpenAlexW3123517799MaRDI QIDQ1909403
Publication date: 1 May 1996
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177004706
asymptotic optimalityproduction controlheavy traffic limitgeneralized \(c\mu\) ruleminimum cumulative delay costsingle-server multiclass queueing system
Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30) Optimal stochastic control (93E20) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items (70)
This page was built for publication: Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule