Staffing and scheduling flexible call centers by two-stage robust optimization

We study the shift scheduling problem in a multi-shift, flexible call center. Differently from previous approaches, the staffing levels ensuring the desired quality of service are considered uncertain, leading to a two-stage robust integer program with right-hand-side uncertainty. We show that, in our setting, modeling the correlation of the demands in consecutive time slots is easier than in other staffing approaches. The complexity issues of a Benders type reformulation are investigated and a branch-and-cut algorithm is devised. The approach can efficiently solve real-world problems from an Italian call center and effectively support managers decisions. In fact, we show that robust shifts have very similar costs to those evaluated by the traditional (deterministic) method while ensuring a higher level of protection against uncertainty.

[1]  Ward Whitt,et al.  Staffing a Call Center with Uncertain Arrival Rate and Absenteeism , 2006 .

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

[3]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[4]  David K. Smith Network Flows: Theory, Algorithms, and Applications , 1994 .

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

[6]  J. F. Benders Partitioning procedures for solving mixed-variables programming problems , 1962 .

[7]  Michel Minoux,et al.  On 2-stage robust LP with RHS uncertainty: complexity results and applications , 2011, J. Glob. Optim..

[8]  Daniel Bienstock,et al.  Computing robust basestock levels , 2008, Discret. Optim..

[9]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[10]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[11]  Itay Gurvich,et al.  Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach , 2010, Manag. Sci..

[12]  M. Segal,et al.  The Operator-Scheduling Problem: A Network-Flow Approach , 1974, Oper. Res..

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

[14]  Mara Servilio,et al.  Robust Shift Scheduling in Call Centers , 2014, ISCO.

[15]  Oualid Jouini,et al.  Staffing a call center with uncertain non-stationary arrival rate and flexibility , 2012, OR Spectr..

[16]  Jean-Philippe Vial,et al.  Distributionally robust workforce scheduling in call centres with uncertain arrival rates , 2013, Optim. Methods Softw..

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

[18]  Tara L. Terry,et al.  Robust Linear Optimization With Recourse , 2009 .

[19]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[20]  Shane G. Henderson,et al.  FORECAST ERRORS IN SERVICE SYSTEMS , 2009, Probability in the Engineering and Informational Sciences.

[21]  Inneke Van Nieuwenhuyse,et al.  Staffing and scheduling under nonstationary demand for service: A literature review , 2016 .

[22]  James R. Luedtke,et al.  Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty , 2017, Manag. Sci..

[23]  Pierre L'Ecuyer,et al.  Modeling Daily Arrivals to a Telephone Call Center , 2003, Manag. Sci..

[24]  Natashia Boland,et al.  Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem , 2003, Networks.

[25]  François Margot,et al.  Testing cut generators for mixed-integer linear programming , 2009, Math. Program. Comput..

[26]  James B. Orlin A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[27]  Michel Minoux Robust Linear Programming with Right-Hand-Side Uncertainty, Duality and Applications , 2009, Encyclopedia of Optimization.

[28]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[29]  Ger Koole,et al.  Optimal Shift Scheduling with a Global Service Level Constraint , 2003 .

[30]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[31]  Peter J. Kolesar,et al.  Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands , 2001, Oper. Res..

[32]  Terry P. Harrison,et al.  A stochastic programming model for scheduling call centers with global Service Level Agreements , 2010, Eur. J. Oper. Res..

[33]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .