Server assignment policies in queues with customer abandonments
From MaRDI portal
Publication:2146417
DOI10.1007/s11134-022-09792-5zbMath1491.90033OpenAlexW4226079089MaRDI QIDQ2146417
Publication date: 16 June 2022
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-022-09792-5
Cites Work
- On scheduling a multiclass queue with abandonments under general delay costs
- On the time-dependent moments of Markovian queues with reneging
- On queues with impatience: stability, and the optimality of earliest deadline first
- Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
- Analysis of an \(M/M/1 + G\) queue operated under the FCFS policy with exact admission control
- Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes
- The \(M/G/1+G\) queue revisited
- Dynamic control of a single-server system with abandonments
- Optimal control of parallel server systems with many servers in heavy traffic
- Online scheduling policies for multiclass call centers with impatient customers
- Dynamic control of a tandem system with abandonments
- TECHNICAL NOTE—A Note on Profit Maximization and Monotonicity for Inbound Call Centers
- The cμ/θ Rule for Many-Server Queues with Abandonment
- Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
- Single-server queues with impatient customers
- Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule
- Fluid Models for Multiserver Queues with Abandonments
- Some Queuing Problems with Balking and Reneging. I
- Many-server queues with customer abandonment: numerical analysis of their diffusion models
- Queuing with Impatient Customers and Ordered Service
- MONOTONICITY PROPERTIES FOR MULTISERVER QUEUES WITH RENEGING AND FINITE WAITING LINES
This page was built for publication: Server assignment policies in queues with customer abandonments
