\(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
type: Item
instance of: scholarly article
title: \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
zbMATH Open document ID: 1498.90244
author: Yanyan Li
published in: Annals of Operations Research
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 7614224
zbMATH Keywords: competing queues
zbMATH Keywords: abandonments
zbMATH Keywords: unbounded transition rates
zbMATH Keywords: smoothed rate truncation
zbMATH Keywords: Markov decision processes
zbMATH Keywords: generalised \(c \mu \)-rule
zbMATH Keywords: uniformisation
MaRDI profile type: Publication
full work available at URL: s10479-019-03131-3
OpenAlex ID: W2908607384
cites work: The cμ/θ Rule for Many-Server Queues with Abandonment
cites work: K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
cites work: On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
cites work: Countable state Markov decision processes with unbounded jump rates and discounted cost: optimality equation and approximations
cites work: The cμ rule revisited
cites work: Dynamic control of a single-server system with abandonments
cites work: Asymptotically optimal index policies for an abandonment queue with convex holding cost
cites work: Optimal static priority rules for stochastic scheduling with impatience
cites work: Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
cites work: Negative Dynamic Programming
cites work: Markov programming by successive approximations with respect to weighted supremum norms
DOI: 10.1007/S10479-019-03131-3
description: scientific article; zbMATH DE number 7614224