Staffing Multiskill Call Centers via Linear Programming and Simulation
Authors:
- 1 February 2008
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 54 (2) , 310-323
Abstract
We study an iterative cutting-plane algorithm on an integer program for minimizing the staffing costs of a multiskill call center subject to service-level requirements that are estimated by simulation. We solve a sample average version of the problem, where the service levels are expressed as functions of the staffing for a fixed sequence of random numbers driving the simulation. An optimal solution of this sample problem is also an optimal solution to the original problem when the sample size is large enough. Several difficulties are encountered when solving the sample problem, especially for large problem instances, and we propose practical heuristics to deal with these difficulties. We report numerical experiments with examples of different sizes. The largest example corresponds to a real-life call center with 65 types of calls and 89 types of agents (skill groups).Keywords
This publication has 16 references indexed in Scilit:
- A Staffing Algorithm for Call Centers with Skill-Based RoutingManufacturing & Service Operations Management, 2005
- Modeling Daily Arrivals to a Telephone Call CenterManagement Science, 2004
- Call Center Staffing with Simulation and Cutting Plane MethodsAnnals of Operations Research, 2004
- Telephone Call Centers: Tutorial, Review, and Research ProspectsManufacturing & Service Operations Management, 2003
- An Object-Oriented Random-Number Package with Many Long Streams and SubstreamsOperations Research, 2002
- Global Stochastic Optimization with Low-Dispersion Point SetsOperations Research, 2000
- On Pooling in Queueing NetworksManagement Science, 1998
- A stochastic approach to stability in stochastic programmingJournal of Computational and Applied Mathematics, 1994
- Convexity of Functions which are Generalizations of the Erlang Loss Function and the Erlang Delay FunctionSIAM Review, 1991
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960