Staffing Multiskill Call Centers via Linear Programming and Simulation
AbstractWe 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).
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 54 (2008)
Issue (Month): 2 (February)
call centers; staffing; optimization by simulation; integer programming; cutting planes; skill-based routing; subgradient cuts;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Kleijnen, J.P.C. & Beers, W.C.M. van & Nieuwenhuyse, I. van, 2008.
"Constrained Optimization in Simulation: A Novel Approach,"
2008-95, Tilburg University, Center for Economic Research.
- Van Nieuwenhuyse, Inneke & Kleijnen, J.P.C. & van Beers, W., 2008. "Constrained optimization in simulation: a novel approach," Open Access publications from Katholieke Universiteit Leuven urn:hdl:123456789/200609, Katholieke Universiteit Leuven.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.