Skip to main content
Article thumbnail
Location of Repository

Staffing multi-skill call centers via search methods and a performance approximation

By Athanassios N. Avramidis, Wyean Chan and Pierre L'Ecuyer


A multi-skill staffing problem in a call center where the agent skill sets are exogenous and the call routing policy has well-specified features of overflow between different agent types is addressed. Constraints are imposed on the service level for each call class, defined here as the steady-state fraction of calls served within a given time threshold, excluded. An approximation of these service levels is developed that allows an arbitrary overflow mechanism and customer abandonment. A two-stage heuristic that finds good solutions to mathematical programs with such constraints is developed. The first stage uses search methods supported by the approximation. Because service level approximation errors may be substantial, the solution is adjusted in a second stage in which performance is estimated by simulation. Realistic problems of varying size and routing policy are solved. The proposed approach is shown to be competitive with (and often better than) previously available methods

Topics: QA, HD28
Year: 2009
OAI identifier:
Provided by: e-Prints Soton

Suggested articles


  1. (2005). A Java library for simulating contact centers. doi
  2. (2005). A method for stang large call centers based on stochastic uid models. doi
  3. (2007). A simple stang method for multi-skill call centers. doi
  4. (2005). A stang algorithm for call centers with skill-based routing. doi
  5. (2006). Approximating multi-skill blocking systems by hyperexponential decomposition. Performance Evaluation 63:799{824. doi
  6. (2004). Call center stang with simulation and cutting plane methods. doi
  7. (2004). Design and control of a large call center: Asymptotic analysis of an LP-based method. doi
  8. (2000). Exponential approximation of multi-skill call centers architecture. doi
  9. (2001). Improving the SIPP approach for stang service systems that have cyclic demands. doi
  10. (1981). Introduction to queueing theory. doi
  11. (2006). Optimisation stochastique pour l'aectation du personnel polyvalent dans un centre d'appels t el ephoniques.
  12. (2004). Optimizing call center stang using simulation and analytic center cutting plane methods. doi
  13. (2003). Over ow analysis and cross-trained servers. doi
  14. (2002). Queueing models of call centers: An introduction.
  15. (1998). Rostering by iterating integer programming and simulation. doi
  16. (2004). Routing and stang in large call centers 32with specialized and fully exible servers.
  17. (2003). Routing heuristics for multi-skill call centers. doi
  18. (2007). Simple methods for shift scheduling in multi-skill call centers. doi
  19. (2007). Stang multiskill call centers via linear programming and simulation. doi
  20. (1989). Stochastic modeling and the theory of queues.
  21. (1983). Stochastic processes. doi
  22. (1962). Stochastic service systems. doi
  23. (2003). Telephone call centers: Tutorial, review, and research prospects. doi
  24. (1974). The design and analysis of computer algorithms. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.