K competing queues with customer abandonment: optimality of a generalised c -rule by the smoothed rate truncation method

DOI10.1007/S10479-019-03131-3MaRDI QIDQ2095210zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 9 November 2022

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10479-019-03131-3

zbMATH Keywords

abandonmentscompeting queuesgeneralised \(c \mu \)-ruleMarkov decision processessmoothed rate truncationunbounded transition ratesuniformisation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)

Recommendations

• The c / rule for many-server queues with abandonment
• Dynamic control of a single-server system with abandonments
• Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• On the asymptotic optimality of the c / rule under ergodic cost

Cites work

• Asymptotically optimal index policies for an abandonment queue with convex holding cost
• Countable state Markov decision processes with unbounded jump rates and discounted cost: optimality equation and approximations
• Dynamic control of a single-server system with abandonments
• 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
• Negative Dynamic Programming
• On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
• Optimal static priority rules for stochastic scheduling with impatience
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• The cμ rule revisited
• The c / rule for many-server queues with abandonment

Cited in

(6)

• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• A uniformization approach for the dynamic control of queueing systems with abandonments
• Whittle index approach to multiserver scheduling with impatient customers and DHR service times
• Scheduling servers in a two-stage queue with abandonments and costs
• Optimal admission control in queues with multiple customer classes and abandonments
• Asymptotically optimal index policies for an abandonment queue with convex holding cost

This page was built for publication: \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095210)