Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach

We consider the problem of staffing call centers with multiple customer classes and agent types operating under quality-of-service (QoS) constraints and demand rate uncertainty. We introduce a formulation of the staffing problem that requires that the QoS constraints are met with high probability with respect to the uncertainty in the demand rate. We contrast this chance-constrained formulation with the average-performance constraints that have been used so far in the literature. We then propose a two-step solution for the staffing problem under chance constraints. In the first step, we introduce a random static planning problem (RSPP) and discuss how it can be solved using two different methods. The RSPP provides us with a first-order (or fluid) approximation for the true optimal staffing levels and a staffing frontier. In the second step, we solve a finite number of staffing problems with known arrival rates---the arrival rates on the optimal staffing frontier. Hence, our formulation and solution approach has the important property that it translates the problem with uncertain demand rates to one with known arrival rates. The output of our procedure is a solution that is feasible with respect to the chance constraint and nearly optimal for large call centers.

[1]  George L. Nemhauser,et al.  An integer programming approach for linear programs with probabilistic constraints , 2010, Math. Program..

[2]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[3]  Benjamin Van Roy,et al.  On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming , 2004, Math. Oper. Res..

[4]  Lewis Ntaimo,et al.  IIS Branch-and-Cut for Joint Chance-Constrained Programs with Random Technology Matrices , 2008 .

[5]  Refik Soyer,et al.  Modeling and Analysis of Call Center Arrival Data: A Bayesian Approach , 2008, Manag. Sci..

[6]  Sem C. Borst,et al.  Dimensioning Large Call Centers , 2000, Oper. Res..

[7]  Ward Whitt,et al.  Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing , 2010, Oper. Res..

[8]  Haipeng Shen,et al.  FORECASTING TIME SERIES OF INHOMOGENEOUS POISSON PROCESSES WITH APPLICATION TO CALL CENTER WORKFORCE MANAGEMENT , 2008, 0807.4071.

[9]  Zeynep Akşin,et al.  The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research , 2007 .

[10]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

[11]  WhittWard,et al.  A Staffing Algorithm for Call Centers with Skill-Based Routing , 2005 .

[12]  James W. Taylor,et al.  A Comparison of Univariate Time Series Methods for Forecasting Intraday Arrivals at a Call Center , 2008, Manag. Sci..

[13]  Shimrit Maman Uncertainty in the Demand for Service: The Case of Call Centers and Emergency Departments , 2009 .

[14]  Darinka Dentcheva,et al.  Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..

[15]  Itay Gurvich,et al.  Service-Level Differentiation in Call Centers with Fully Flexible Servers , 2008, Manag. Sci..

[16]  Shane G. Henderson,et al.  Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods , 2008, Manag. Sci..

[17]  Alexander L. Stolyar,et al.  Control of systems with flexible multi-server pools: a shadow routing approach , 2010, Queueing Syst. Theory Appl..

[18]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[19]  A. Nemirovski,et al.  Scenario Approximations of Chance Constraints , 2006 .

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

[21]  Haipeng Shen,et al.  Parametric Stochastic Programming Models for Call-Center Workforce Scheduling , 2012 .

[22]  Ramandeep S. Randhawa,et al.  Capacity Sizing Under Parameter Uncertainty: Safety Staffing Principles Revisited , 2010, Manag. Sci..

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

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

[25]  Avishai Mandelbaum,et al.  Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers , 2011, Oper. Res..

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

[27]  Thomas D. Sandry,et al.  Probabilistic and Randomized Methods for Design Under Uncertainty , 2007, Technometrics.

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

[29]  Avishai Mandelbaum,et al.  Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers , 2009, Oper. Res..

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

[31]  Armann Ingolfsson,et al.  Markov chain models of a telephone call center with call blending , 2007, Comput. Oper. Res..

[32]  GurvichItai,et al.  Staffing Call Centers with Uncertain Demand Forecasts , 2010 .

[34]  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..

[35]  Jonathan Weinberg,et al.  Bayesian Forecasting of an Inhomogeneous Poisson Process With Applications to Call Center Data , 2007 .

[36]  Vijay Mehrotra,et al.  Intelligent Procedures for Intra‐Day Updating of Call Center Agent Schedules , 2009 .

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

[38]  Tolga Tezcan,et al.  State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems , 2011, Math. Oper. Res..

[39]  Pierre L'Ecuyer,et al.  Staffing Multiskill Call Centers via Linear Programming and Simulation , 2008, Manag. Sci..

[40]  Giuseppe Carlo Calafiore,et al.  Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..

[41]  Andrzej Ruszczynski,et al.  Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra , 2002, Math. Program..

[42]  James R. Luedtke An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs , 2010, IPCO.

[43]  Terry P. Harrison,et al.  Partial cross training in call centers with uncertain arrivals and global service level agreements , 2007, 2007 Winter Simulation Conference.

[44]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[45]  Haipeng Shen,et al.  Interday Forecasting and Intraday Updating of Call Center Arrivals , 2008, Manuf. Serv. Oper. Manag..

[46]  Xuan Vinh Doan,et al.  Robust and data-driven approaches to call centers , 2010, Eur. J. Oper. Res..

[47]  Tolga Tezcan,et al.  Optimal control of parallel server systems with many servers in heavy traffic , 2008, Queueing Syst. Theory Appl..

[48]  Garud Iyengar,et al.  On two-stage convex chance constrained problems , 2007, Math. Methods Oper. Res..

[49]  Simge Küçükyavuz,et al.  On mixing sets arising in chance-constrained programming , 2012, Math. Program..

[50]  Lewis Ntaimo,et al.  IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation , 2010, Eur. J. Oper. Res..