Scheduling of multi-class multi-server queueing systems with abandonments
From MaRDI portal
Publication:2398642
DOI10.1007/s10951-015-0456-7zbMath1373.90066OpenAlexW2255981264MaRDI QIDQ2398642
Urtzi Ayesta, Peter Jacko, Vladimír Novák
Publication date: 18 August 2017
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/76960/1/abandon_JSCHED.pdf
Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Related Items
Cites Work
- On scheduling a multiclass queue with abandonments under general delay costs
- Introduction: queueing systems special issue on queueing systems with abandonments
- Dynamic control of a single-server system with abandonments
- On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost
- Dynamic priority allocation via restless bandit marginal productivity indices
- On priority queues with impatient customers
- Online scheduling policies for multiclass call centers with impatient customers
- Arm-acquiring bandits
- Multiple feedback at a single-server station
- To queue or not to queue: equilibrium behavior in queueing systems.
- On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers
- The Complexity of Optimal Queuing Network Control
- Hard Real-Time Computing Systems
- The cμ/θ Rule for Many-Server Queues with Abandonment
- Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments
- A Multiserver Queueing System with Impatient Customers
- Scheduling for Minimum Total Loss Using Service Time Distributions
- The cμ rule revisited
- Single-server queues with impatient customers
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
- The Application of Queueing Theory to Continuous Perishable Inventory Systems
- On an index policy for restless bandits
- Level Crossings in Point Processes Applied to Queues: Single-Server Case
- On the optimal allocation of service to impatient tasks
- Scheduling with Random Arrivals and Linear Loss Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Scheduling of multi-class multi-server queueing systems with abandonments