Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement
From MaRDI portal
Publication:3186654
DOI10.1287/ijoc.2015.0675zbMath1343.90026OpenAlexW2295088638MaRDI QIDQ3186654
Terry James, Kyle Y. Lin, Kevin D. Glazebrook
Publication date: 12 August 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/76460/2/paper_ijoc_revision_FINAL.pdf
Markov decision processcustomer abandonmentindex policymulticlass queueapproximate policy improvement
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)
Related Items
On the computation of Whittle's index for Markovian restless bandits ⋮ The setting and optimization of quick queue with customer loss
Cites Work
- On scheduling a multiclass queue with abandonments under general delay costs
- Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes
- Dynamic control of a single-server system with abandonments
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits
- Online scheduling policies for multiclass call centers with impatient customers
- Existence of good lattice points in the sense of Hlawka
- The cμ/θ Rule for Many-Server Queues with Abandonment
- Modeling and analysis of uncertain time-critical tasking problems
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- Dynamic policies for uncertain time‐critical tasking problems
- An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
- Scheduling policies for an antiterrorist surveillance system
- Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
- Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
- Time-Sharing Service Systems. II
- Time-Sharing Service Systems. I
- On the optimal allocation of service to impatient tasks
