Whittle index approach to multiserver scheduling with impatient customers and DHR service times
From MaRDI portal
Publication:6579137
DOI10.1007/s11134-024-09902-5zbMATH Open1546.60163MaRDI QIDQ6579137
Publication date: 25 July 2024
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotically optimal priority policies for indexable and nonindexable restless bandits
- On queues with impatience: stability, and the optimality of earliest deadline first
- Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes
- Dynamic control of a single-server system with abandonments
- On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- Arm-acquiring bandits
- Discrete hazard rate functions
- \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
- On the Gittins index in the M/G/1 queue
- Scheduling of multi-class multi-server queueing systems with abandonments
- The cμ/θ Rule for Many-Server Queues with Abandonment
- Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule
- On an index policy for restless bandits
- Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy
- Technical Note—Stochastic Scheduling with Abandonment: Necessary and Sufficient Conditions for the Optimality of a Strict Priority Policy
This page was built for publication: Whittle index approach to multiserver scheduling with impatient customers and DHR service times
