Staffing multiskill call centers via linear programming and simulation

Management Science

Volumn 54, Issue 2, 2008, Pages 310-323

  Cezik, Mehmet Tolga ^a   L'Ecuyer, Pierre ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Call centers; Cutting planes; Integer programming; Optimization by simulation; Skill based routing; Staffing; Subgradient cuts

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; INTEGER PROGRAMMING; ITERATIVE METHODS; LINEAR PROGRAMMING;

CALL CENTERS; CUTTING PLANES; SKILL-BASED ROUTING;

OUTSOURCING;

EID: 39649084233     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1070.0824     Document Type: Article

References (23)

1. Atlason, J., M. A. Epelman, S. G. Henderson. 2003. Using simulation to approximate subgradients of convex performance measures in service systems. Proc. 2003 Winter Simulation Conf., IEEE Press, Piscataway, NJ, 1824-1832.
2. Atlason, J., M. A. Epelman, S. G. Henderson. 2004. Call center staffing with simulation and cutting plane methods. Ann. Oper. Res. 127 333-358.
3. Avramidis, A. N., A. Deslauriers, P. L'Ecuyer. 2004. Modeling daily arrivals to a telephone call center. Management Sci. 50(7) 896-908.
4. Buist, E., P. L'Ecuyer. 2005. A java library for simulating contact centers. Proc. 2005 Winter Simulation Conf, IEEE Press, Piscataway, NJ, 556-565.
5. Ellis, R. S. 1985. Entropy, Large Deviations, and Statistical Mechanics. Springer Verlag, New York.
6. Gans, N., G. Koole, A. Mandelbaum. 2003. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2) 79-141.
7. Garnett, O., A. Mandelbaum. 2000. An introduction to skills-based routing and its operational complexities. Teaching note, Technion University, Israel.
8. Henderson, S., A. Mason. 1998. Rostering by iterating integer programming and simulation. Proc. 1998 Winter Simulation Conf., Vol. 1, IEEE Press, Piscataway, NJ, 677-683.
9. Ingolfsson, A., E. Cabral, X. Wu. 2003. Combining integer programming and the randomization method to schedule employees. Technical report, School of Business, University of Alberta, Edmonton, Alberta, Canada.
10. Jagers, A. A., E. A. van Doom. 1991. Convexity of functions which are generalizations of the Erlang loss function and the Erlang delay function. SIAM Rev. 33 281-282.
11. Jennings, O. B., A. Mandelbaum, W A. Massey, W. Whitt. 1996. Server staffing to meet time-varying demand. Management Sci. 42(10) 1383-1394.
12. Kelley Jr., J. E. 1960. The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8(4) 703-712.
13. Koole, G., A. Mandelbaum. 2002. Queueing models of call centers: An introduction. Ann. Oper. Res. 113 41-59.
14. Koole, G., J. Talim. 2000. Exponential approximation of multi-skill call centers architecture. Proc. QNETs, Ilkley, UK, 23/1-10.
15. Koole, G., A. Pot, J. Talim. 2003. Routing heuristics for multi-skill call centers. Proc. 2003 Winter Simulation Conf, IEEE Press, Piscataway, NJ, 1813-1816.
16. Law, A. M., W D. Kelton. 2000. Simulation Modeling and Analysis, 3rd ed. McGraw-Hill, New York.
17. L'Ecuyer, P. 2004. SSJ: A Java Library for Stochastic Simulation. Software user's guide, http://www.iro.umontreal.ca/~lecuyer.
18. L'Ecuyer, P., R. Simard, E. J. Chen, W. D. Kelton. 2002. An objectoriented random-number package with many long streams and substreams. Oper. Res. 50(6) 1073-1075.
19. Mandelbaum, A., M. I. Reimann. 1998. On pooling in queueing networks. Management Sci. 44(7) 971-981.
20. Shwartz, A., A. Weiss. 1995. Large Deviations for Performance Analysis. Chapman and Hall, London.
21. Vogel, S. 1994. A stochastic approach to stability in stochastic programming. J. Comput. Appl. Math. 56 65-96.
22. Wallace, R. B., W Whitt. 2005. A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management 7(4) 276-294.
23. Yakowitz, S., P. L'Ecuyer, F. Vázquez-Abad. 2000. Global stochastic optimization with low-discrepancy point sets. Oper. Res. 48(6) 939-950.