Fluid Models for Multiserver Queues with Abandonments
Operations Research
Heavy-traffic limits for many-server queues with service interruptions
Queueing Systems: Theory and Applications
Responding to Unexpected Overloads in Large-Scale Service Systems
Management Science
Service Interruptions in Large-Scale Service Systems
Management Science
Heavy-traffic extreme value limits for Erlang delay models
Queueing Systems: Theory and Applications
The average response time in a heavy-traffic srpt queue
ACM SIGMETRICS Performance Evaluation Review
The cμ/θ Rule for Many-Server Queues with Abandonment
Operations Research
A Fluid Approximation for Service Systems Responding to Unexpected Overloads
Operations Research
Shadow-Routing Based Control of Flexible Multiserver Pools in Overload
Operations Research
Queues with Many Servers and Impatient Customers
Mathematics of Operations Research
Two fluid approximations for multi-server queues with abandonments
Operations Research Letters
A Diffusion Regime with Nondegenerate Slowdown
Operations Research
Overflow Networks: Approximations and Implications to Call Center Outsourcing
Operations Research
Fluid models of many-server queues with abandonment
Queueing Systems: Theory and Applications
An Overloaded Multiclass FIFO Queue with Abandonments
Operations Research
Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations
INFORMS Journal on Computing
A Fluid Limit for an Overloaded X Model via a Stochastic Averaging Principle
Mathematics of Operations Research
Dynamic fluid-based scheduling in a multi-class abandonment queue
Performance Evaluation
Data-stories about (im)patient customers in tele-queues
Queueing Systems: Theory and Applications
Diffusion approximation for an overloaded X model via a stochastic averaging principle
Queueing Systems: Theory and Applications
| Hi-index | 0.01 |
To provide useful practical insight into the performance of service-oriented (non-revenue-generating) call centers, which often provide low-to-moderate quality of service, this paper investigates the efficiency-driven (ED), many-server heavy-traffic limiting regime for queues with abandonments. Attention is focused on theM/M/s/r + M model, having a Poisson arrival process, exponential service times,s servers,r extra waiting spaces, exponential abandon times (the final + M), and the first-come-first-served service discipline. Both the number of servers and the arrival rate are allowed to increase, while the individual service and abandonment rates are held fixed. The key is how the two limits are related: In the now common quality-and-efficiency-driven (QED) or Halfin-Whitt limiting regime, the probability of initially being delayed approaches a limit strictly between 0 and 1, while the probability of eventually being served (not abandoning) approaches 1. In contrast, in the ED limiting regime, the probability of eventually being served approaches a limit strictly between 0 and 1, while the probability of initially being delayed approaches 1. To obtain the ED regime, it suffices to let the arrival rate and the number of servers increase with the traffic intensity ? held fixed with ? 1 (so that the arrival rate exceeds the maximum possible service rate). The ED regime can be realistic because with the abandonments, the delays need not be extraordinarily large. When the ED appropriations are appropriate, they are appealing because they are remarkably simple.