Service-Level Agreements in Call Centers: Perils and Prescriptions

Acall center with both contract and noncontract customers was giving priority to the contract customers only in off-peak hours, precisely when having priority was least important. In this paper, we investigate whether this is rational behavior on the part of the call center and what the implications are for customers. In particular, we show that under contracts on the percentile of delay, which are commonly used in the call center industry, this is rational behavior, at least under the approximating asymptotic regime considered in this paper. We then suggest other contracts that do not result in this type of undesirable behavior from a contract customer's perspective. We compare the performance of the different contracts in terms of mean, variance, and outer percentiles of delay for both customer types using both numerical and asymptotic heavy-traffic analyses. We argue that including terms reflecting the second moment of delay in a contract would be beneficial to contract customers and, in a sense, fairer.

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

[2]  R. Atar.  Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic , 2005, math/0602526.

[3]  J. V. Mieghem.  Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule , 1995 .

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

[5]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

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

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

[8]  Ger Koole.  Redefining the service level in call centers , 2003 .

[9]  Vijay Mehrotra,et al.  A Call Center Uses Simulation to Drive Strategic Change , 2001, Interfaces.

[10]  R. Atar.  A diffusion model of scheduling control in queueing systems with many servers , 2005, math/0503518.

[11]  Erica L. Plambeck,et al.  A Multiclass Queue in Heavy Traffic with Throughput Time Constraints: Asymptotically Optimal Dynamic Controls , 2001, Queueing Syst. Theory Appl..

[12]  Fikri Karaesmen,et al.  Call Center Outsourcing Contract Design and Choice , 2004 .

[13]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

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

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

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

[17]  Sandjai Bhulai,et al.  A queueing model for call blending in call centers , 2003, IEEE Trans. Autom. Control..

[18]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.

[19]  Ward Whitt,et al.  A Diffusion Approximation for the G/GI/n/m Queue , 2004, Oper. Res..

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

[21]  M.C. Fu,et al.  Fluid approximations for a priority call center with time-varying arrivals , 2003, Proceedings of the 2003 Winter Simulation Conference, 2003..

[22]  Constantinos Maglaras,et al.  Decision , Risk and Operations Working Papers Series Contact Centers with a CallBack Option and Real-Time Delay Information , 2004 .

[23]  J. Michael Harrison,et al.  Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method , 2006, Oper. Res..

[24]  Jan A. Van Mieghem,et al.  Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .

[25]  Avishai Mandelbaum,et al.  A Brownian control problem for a simple queueing system in the Halfin-Whitt regime , 2004, Syst. Control. Lett..

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

[27]  Peter W. Glynn,et al.  Chapter 4 Diffusion approximations , 1990 .

[28]  Moshe Haviv,et al.  Price and delay competition between two service providers , 2003, Eur. J. Oper. Res..

[29]  Constantinos Maglaras,et al.  Queueing Systems with Leadtime Constraints: A Fluid-Model Approach for Admission and Sequencing Control , 2004, Eur. J. Oper. Res..

[30]  D. E. Heyman,et al.  Diffusion Approximations , 2004 .

[31]  R. Cross,et al.  A practical guide to social networks. , 2005, Harvard business review.

[32]  W. Whitt.  Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.

[33]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[34]  Zhang Hanqin,et al.  MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC , 1990 .

[35]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

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

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

[38]  Fikri Karaesmen,et al.  Call Center Outsourcing Contract Analysis and Choice , 2008, Manag. Sci..