Corpus ID: 73672258

2 Preliminaries : Bounds and expansions for Erlang C

@inproceedings{Janssen20082P,
  title={2 Preliminaries : Bounds and expansions for Erlang C},
  author={A. Janssen and J. V. Leeuwaarden and B. Zwart},
  year={2008}
}
We apply a new corrected diffusion approximation for the Erlang C formula to determine server staffing levels in cost minimization and constraint satisfaction problems. These problems are motivated by large customer contact centers that are modeled as an M/M/s queue with s the number of servers or agents. The proposed server staffing levels are refinements of the celebrated square root staffing rule, and have the appealing property that they are as simple as the conventional square root… CONTINUE READING

Figures and Tables from this paper.

References

SHOWING 1-10 OF 22 REFERENCES
Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers
  • 154
  • PDF
Dimensioning Large Call Centers
  • 342
  • Highly Influential
  • PDF
Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
  • 25
  • PDF
Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue
  • 238
  • PDF
Heavy Traffic Limits for Queues with Many Deterministic Servers
  • 77
  • PDF
Understanding the Efficiency of Multi-Server Service Systems
  • 170
  • Highly Influential
Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic
  • 92
  • PDF
The multiclass GI/PH/N queue in the Halfin-Whitt regime
  • 139
Heavy-Traffic Limits for the G/H2*/n/mQueue
  • W. Whitt
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 2005
  • 72
  • PDF
Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime
  • 46
  • PDF