Whittle's index policy for a multi-class queueing system with convex holding costs
From MaRDI portal
Publication:1395142
DOI10.1007/s001860200257zbMath1023.90010MaRDI QIDQ1395142
M. O'Keeffe, P. S. Ansell, 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
90B15: Stochastic network models in operations research
90B22: Queues and service in operations research
90B36: Stochastic scheduling theory in operations research
90C39: Dynamic programming
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Related Items
On the optimal allocation of service to impatient tasks, Monotone Policies and Indexability for Bidirectional Restless Bandits, A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits, Some indexable families of restless bandit problems, Spinning plates and squad systems: policies for bi-directional restless bandits, Time-dependent performance approximation of truck handling operations at an air cargo terminal, Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule, Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation, Asymptotically optimal index policies for an abandonment queue with convex holding cost, The single-server scheduling problem with convex costs, Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach, Dynamic routing to heterogeneous collections of unreliable servers, Grid Brokering for Batch Allocation Using Indexes, DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
