Whittle's index policy for a multi-class queueing system with convex holding costs
DOI10.1007/S001860200257zbMATH Open1023.90010OpenAlexW1965665090MaRDI QIDQ1395142FDOQ1395142
Authors: P. S. Ansell, Michael O'Keeffe, Kevin D. Glazebrook, José Niño-Mora 
Publication date: 26 June 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860200257
Recommendations
- Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups
- On scheduling a multiclass queue with abandonments under general delay costs
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queues and service in operations research (90B22) Dynamic programming (90C39) Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)
Cited In (23)
- Monotone policies and indexability for bidirectional restless bandits
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Grid Brokering for Batch Allocation Using Indexes
- On the optimal allocation of service to impatient tasks
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Minimizing the mean slowdown in the M/G/1 queue
- A verification theorem for threshold-indexability of real-state discounted restless bandits
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- Some indexable families of restless bandit problems
- On the computation of Whittle's index for Markovian restless bandits
- Conditions for indexability of restless bandits and an algorithm to compute Whittle index
- Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
- Time-dependent performance approximation of truck handling operations at an air cargo terminal
- Dynamic routing to heterogeneous collections of unreliable servers
- Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach
- Spinning plates and squad systems: policies for bi-directional restless bandits
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
- Whittle index approach to the multi-class queueing systems with convex holding costs and ihr service times
- Exponential asymptotic optimality of Whittle index policy
- Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
- Testing indexability and computing Whittle and Gittins index in subcubic time
- The single-server scheduling problem with convex costs
- On the Whittle index of Markov modulated restless bandits
This page was built for publication: Whittle's index policy for a multi-class queueing system with convex holding costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395142)
