Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method

This paper analyzes a call center model with m customer classes and r agent pools. The model is one with doubly stochastic arrivals, which means that the m-vector of instantaneous arrival rates is allowed to vary both temporally and stochastically. Two levels of call center management are considered: staffing the r pools of agents, and dynamically routing calls to agents. The system managers objective is to minimize the sum of personnel costs and abandonment penalties. We consider a limiting parameter regime that is natural for call centers and relatively easy to analyze, but apparently novel in the literature of applied probability. For that parameter regime, we prove an asymptotic lower bound on expected total cost, which uses a strikingly simple distillation of the original system data. We then propose a method for staffing and routing based on linear programming (LP), and show that it achieves the asymptotic lower bound on expected total cost; in that sense the proposed method is asymptotically optimal.

[1]  J. Michael Harrison,et al.  A Method for Staffing Large Call Centers Based on Stochastic Fluid Models , 2005, Manuf. Serv. Oper. Manag..

[2]  Ward Whitt.  Two fluid approximations for multi-server queues with abandonments , 2005, Oper. Res. Lett..

[3]  Avishai Mandelbaum,et al.  Statistical Analysis of a Telephone Call Center , 2005 .

[4]  Garrett van Ryzin,et al.  Optimal Control of a Multiclass, Flexible Queueing System , 1997, Oper. Res..

[5]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[6]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[7]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[8]  P. Bremaud,et al.  Point Processes and Queues: Martingale Dynamics (Springer Series in Statistics) , 1981 .

[9]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

[10]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[11]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[12]  Avishai Mandelbaum,et al.  Strong approximations for Markovian service networks , 1998, Queueing Syst. Theory Appl..

[13]  Ward Whitt,et al.  Understanding the Efficiency of Multi-Server Service Systems , 1992 .

[14]  J. Michael Harrison,et al.  Heavy traffic resource pooling in parallel‐server systems , 1999, Queueing Syst. Theory Appl..

[15]  Rami Atar,et al.  Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic , 2004, math/0407058.

[16]  Alexander L. Stolyar,et al.  Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..

[17]  T. Kurtz.  Strong approximation theorems for density dependent Markov chains , 1978 .

[18]  J. Michael Harrison,et al.  Dynamic Routing and Admission Control in High-Volume Service Systems: Asymptotic Analysis via Multi-Scale Fluid Limits , 2005, Queueing Syst. Theory Appl..

[19]  Ward Whitt,et al.  Fluid Models for Multiserver Queues with Abandonments , 2006, Oper. Res..

[20]  W. Whitt.  The pointwise stationary approximation for M 1 / M 1 / s , 1991 .

[21]  Noah Gans,et al.  A Call-Routing Problem with Service-Level Constraints , 2003, Oper. Res..

[22]  Mor Armony,et al.  Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers , 2005, Queueing Syst. Theory Appl..

[23]  W. A. Massey,et al.  Uniform acceleration expansions for Markov chains with time-varying rates , 1998 .

[24]  P. Brémaud.  Point processes and queues, martingale dynamics , 1983 .

[25]  R. J. Williams,et al.  Dynamic Scheduling of a System with Two Parallel Servers in Heavy Traac with Complete Resource Pooling: Asymptotic Optimality of a Continuous Review Threshold Policy 1 , 1999 .

[26]  Ward Whitt,et al.  Server Staffing to Meet Time-Varying Demand , 1996 .

[27]  N. U. Prabhu,et al.  Stochastic Processes and Their Applications , 1999 .

[28]  Avishai Mandelbaum,et al.  Staffing and Control of Large-Scale Service Systems with Multiple Customer Classes and Fully Flexible Servers , 2005 .

[29]  Shane G. Henderson,et al.  Two Issues in Setting Call Centre Staffing Levels , 2001, Ann. Oper. Res..

[30]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[31]  J. Harrison.  Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies , 1998 .

[32]  J. Michael Harrison,et al.  Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime , 2004, Oper. Res..

[33]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[34]  Ward Whitt,et al.  A Staffing Algorithm for Call Centers with Skill-Based Routing , 2005, Manuf. Serv. Oper. Manag..

[35]  H. M. Taylor,et al.  An introduction to stochastic modeling , 1985 .

[36]  Constantinos Maglaras,et al.  On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design , 2004, Oper. Res..

[37]  J. Aubin.  Set-valued analysis , 1990 .

[38]  P. Kolesar,et al.  The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals , 1991 .

[39]  Ward Whitt,et al.  An Introduction to Stochastic-Process Limits and their Application to Queues , 2002 .

[40]  Ward Whitt,et al.  Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments , 2004, Manag. Sci..

[41]  P. Brémaud.  Point Processes and Queues , 1981 .