Asymptotically optimal index policies for an abandonment queue with convex holding cost
From MaRDI portal
Publication:747712
DOI10.1007/s11134-015-9445-yzbMath1341.68018OpenAlexW210869371MaRDI QIDQ747712
M. Larrañaga, Urtzi Ayesta, Ina Maria Verloop
Publication date: 19 October 2015
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-015-9445-y
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement, Testing indexability and computing Whittle and Gittins index in subcubic time, On the modelling and performance measurement of service networks with heterogeneous customers, Asymptotically optimal index policies for an abandonment queue with convex holding cost, On the Whittle index of Markov modulated restless bandits, \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method, Whittle index based Q-learning for restless bandits with average reward, A Restless Bandit Model for Resource Allocation, Competition, and Reservation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotically optimal priority policies for indexable and nonindexable restless bandits
- On scheduling a multiclass queue with abandonments under general delay costs
- Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes
- Introduction: queueing systems special issue on queueing systems with abandonments
- On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
- 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
- Dynamic priority allocation via restless bandit marginal productivity indices
- Asymptotically optimal parallel resource assignment with interference
- Whittle's index policy for a multi-class queueing system with convex holding costs
- Optimal control of single-server fluid networks
- Fluid approximation of a controlled multiclass tandem network
- Asymptotic optimality of tracking policies in stochastic networks.
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- The single-server scheduling problem with convex costs
- \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
- Multi‐Armed Bandit Allocation Indices
- Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
- The cμ/θ Rule for Many-Server Queues with Abandonment
- The cμ rule revisited
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- On an index policy for restless bandits
- On the optimal allocation of service to impatient tasks
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
