On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost

From MaRDI portal
Revision as of 08:18, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (20)

On the asymptotic optimality of the \(c\mu\)-rule in queueing networksOn scheduling a multiclass queue with abandonments under general delay costsScheduling of multi-class multi-server queueing systems with abandonmentsRouting and Staffing in Customer Service Chat Systems with Impatient CustomersDynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classesLong-Time Limit of Nonlinearly Coupled Measure-Valued Equations that Model Many-Server Queues with RenegingErgodic control of multi-class \(\mathrm{M}/\mathrm{M}/N+\mathrm{M}\) queues in the Halfin-Whitt regimeThe single-server scheduling problem with convex costsAn ergodic control problem for many-server multiclass queueing systems with cross-trained serversOn the modelling and performance measurement of service networks with heterogeneous customersOptimal scheduling of critically loaded multiclass \(GI/m/n+m\) queues in an alternating renewal environmentVirtual allocation policies for many-server queues with abandonmentAsymptotically optimal index policies for an abandonment queue with convex holding costWorkload-Dependent Dynamic Priority for the Multiclass Queue with RenegingDynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized /h RuleQED limits for many-server systems under a priority policyFluid Limits for Many-Server Systems with Reneging Under a Priority PolicyModeling abandonment behavior among patientsAsymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover timesScheduling 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