Management Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANAGEMENT SCIENCE
Vol. 54, No. 2, February 2008, pp. 310-323
DOI: 10.1287/mnsc.1070.0824
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Cezik, M. T.
Right arrow Articles by L'Ecuyer, P.
Right arrow Search for Related Content

Staffing Multiskill Call Centers via Linear Programming and Simulation

Mehmet Tolga Cezik, Pierre L'Ecuyer

GERAD and Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succ. Centre-Ville, Montréal H3C 3J7, Canada
GERAD and Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succ. Centre-Ville, Montréal H3C 3J7, Canada

mehmetc{at}amazon.com
lecuyer{at}iro.umontreal.ca

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).

Key Words: call centers; staffing; optimization by simulation; integer programming; cutting planes; skill-based routing; subgradient cuts
History: Received: November 11, 2004;


This article has been cited by other articles:


Home page
INFORMS Journal on ComputingHome page
D. Terekhov, J. C. Beck, and K. N. Brown
A Constraint Programming Approach for Solving a Queueing Design and Control Problem
INFORMS Journal on Computing, October 1, 2009; 21(4): 549 - 561.
[Abstract] [PDF]


Home page
Operations ResearchHome page
A. Bassamboo and A. Zeevi
On a Data-Driven Method for Staffing Large Call Centers
Operations Research, May 1, 2009; 57(3): 714 - 726.
[Abstract] [PDF]


Home page
MSOMHome page
S. Bhulai, G. Koole, and A. Pot
Simple Methods for Shift Scheduling in Multiskill Call Centers
MSOM, June 1, 2008; 10(3): 411 - 420.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2008 by INFORMS.