\(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
From MaRDI portal
Publication:2095210
DOI10.1007/s10479-019-03131-3zbMath1498.90244OpenAlexW2908607384MaRDI QIDQ2095210
Publication date: 9 November 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03131-3
Markov decision processesabandonmentsuniformisationunbounded transition ratescompeting queuesgeneralised \(c \mu \)-rulesmoothed rate truncation
Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)
Related Items
Cites Work
- On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
- Dynamic control of a single-server system with abandonments
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
- Markov programming by successive approximations with respect to weighted supremum norms
- Optimal static priority rules for stochastic scheduling with impatience
- Countable state Markov decision processes with unbounded jump rates and discounted cost: optimality equation and approximations
- Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
- The cμ/θ Rule for Many-Server Queues with Abandonment
- The cμ rule revisited
- Negative Dynamic Programming
