On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost
From MaRDI portal
Publication:632219
DOI10.1007/S11134-010-9206-XzbMath1217.90063OpenAlexW2107055524MaRDI QIDQ632219
Nahum Shimkin, Rami Atar, Chanit Giat
Publication date: 15 March 2011
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-010-9206-x
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (20)
On the asymptotic optimality of the \(c\mu\)-rule in queueing networks ⋮ On scheduling a multiclass queue with abandonments under general delay costs ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ Routing and Staffing in Customer Service Chat Systems with Impatient Customers ⋮ Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes ⋮ Long-Time Limit of Nonlinearly Coupled Measure-Valued Equations that Model Many-Server Queues with Reneging ⋮ Ergodic control of multi-class \(\mathrm{M}/\mathrm{M}/N+\mathrm{M}\) queues in the Halfin-Whitt regime ⋮ The single-server scheduling problem with convex costs ⋮ An ergodic control problem for many-server multiclass queueing systems with cross-trained servers ⋮ On the modelling and performance measurement of service networks with heterogeneous customers ⋮ Optimal scheduling of critically loaded multiclass \(GI/m/n+m\) queues in an alternating renewal environment ⋮ Virtual allocation policies for many-server queues with abandonment ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost ⋮ Workload-Dependent Dynamic Priority for the Multiclass Queue with Reneging ⋮ Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule ⋮ QED limits for many-server systems under a priority policy ⋮ Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy ⋮ Modeling abandonment behavior among patients ⋮ Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times ⋮ Scheduling to Differentiate Service in a Multiclass Service System
Cites Work
This page was built for publication: On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost