Advertisement

Annals of Operations Research

, Volume 127, Issue 1–4, pp 333–358 | Cite as

Call Center Staffing with Simulation and Cutting Plane Methods

  • Júlíus Atlason
  • Marina A. Epelman
  • Shane G. Henderson
Article

Abstract

We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time periods. We assume that the service level cannot be easily computed, and instead is evaluated using simulation. The simulation uses the method of common random numbers, so that the same sequence of random phenomena is observed when evaluating different staffing plans. In other words, we solve a sample average approximation problem. We establish convergence of the cutting plane method on a given sample average approximation. We also establish both convergence, and the rate of convergence, of the solutions to the sample average approximation to solutions of the original problem as the sample size increases. The cutting plane method relies on the service level functions being concave in the number of servers. We show how to verify this requirement as our algorithm proceeds. A numerical example showcases the properties of our method, and sheds light on when the concavity requirement can be expected to hold.

simulation optimization call centers cutting planes sample average approximation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akşin, O.Z. and P.T. Harker. (2001). “Modeling a Phone Center: Analysis of a Multichannel, Multiresource Processor Shared Loss System.” Management Science 47(2), 324-336.Google Scholar
  2. Bazaraa, M.S., H.D. Sherali, and C.M. Shetty. (1993). Nonlinear Programming: Theory and Algorithms. New York: Wiley.Google Scholar
  3. Benders, J.F. (1962). “Partitioning Procedures for Solving Mixed-Variables Programming Problems.” Numerische Mathematik 4, 238-252.Google Scholar
  4. Billingsley, P. (1995). Probability and Measure, 3rd ed. New York: Wiley.Google Scholar
  5. Birge, J.R. and F. Louveaux. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research. New York: Springer.Google Scholar
  6. Chen, B.P.K. and S.G. Henderson. (2001). “Two Issues in Setting Call Centre Staffing Levels.” Annals of Operations Research 108(1), 175-192.Google Scholar
  7. Chen, H. and B.W. Schmeiser. (2001). “Stochastic Root Finding via Retrospective Approximation.” IIE Transactions 33(3), 259-275.Google Scholar
  8. Dai, L., C.H. Chen, and J.R. Birge. (2000). “Convergence Properties of Two-Stage Stochastic Programming.” Journal of Optimization Theory and Applications 106(3), 489-509.Google Scholar
  9. Dantzig, G.B. (1954). “A Comment on Edie's “Traffic Delays at Toll Booths”.” Operations Research 2(3), 339-341.Google Scholar
  10. Dyer, M.E. and L.G. Proll. (1977). “On the Validity of Marginal Analysis for Allocating Servers in M/M/c Queues.” Management Science 23(9), 1019-1022.Google Scholar
  11. Glasserman, P. (1991). Gradient Estimation Via Perturbation Analysis. Norwell, MA: Kluwer.Google Scholar
  12. Green, L., P.J. Kolesar, and J. Soares. (2001). “Improving the SIPP Approach for Staffing Service Systems that Have Cyclic Demands.” Operations Research 49(4), 549-564.Google Scholar
  13. Healy, K. and L.W. Schruben. (1991). “Retrospective Simulation Response Optimization.” In B.L. Nelson, W.D. Kelton, and G.M. Clark (eds.), Proceedings of the 1991 Winter Simulation Conference, pp. 901-906. Piscataway, NJ: IEEE.Google Scholar
  14. Henderson, S.G. and A.J. Mason. (1998). “Rostering by Iterating Integer Programming and Simulation.” In D.J. Medeiros, E.F.Watson, J.S. Carson, and M.S.Manivannan (eds.), Proceedings of the 1998 Winter Simulation Conference, pp. 677-683. Piscataway, NJ: IEEE.Google Scholar
  15. Higle, J.L. and S. Sen. (1991). “Stochastic Decomposition: An Algorithm for Two-Stage Stochastic Linear Programs with Recourse.” Mathematics of Operations Research 16, 650-669.Google Scholar
  16. Infanger, G. (1994). Planning under Uncertainty: Solving Large-Scale Stochastic Linear Programs. Danvers, MA: Boyd and Fraser.Google Scholar
  17. Ingolfsson, A. and E. Cabral. (2002). “Combining Integer Programming and the Randomization Method to Schedule Employees.” Research Report No. 02-1, University of Alberta.Google Scholar
  18. Ingolfsson, A., M.A. Haque, and A. Umnikov. (2002). “Accounting for Time-Varying Queueing Effects in Workforce Scheduling.” European Journal of Operational Research 139, 585-597.Google Scholar
  19. Jennings, O.B., A. Mandelbaum, W.A. Massey, and W. Whitt. (1996). “Server Staffing to Meet Time-Varying Demand.” Management Science 42(10), 1383-1394.Google Scholar
  20. Kelley, J.E., Jr. (1960). “The Cutting-Plane Method for Solving Convex Programs.” Journal of the Society for Industrial and Applied Mathematics 8(4), 703-712.Google Scholar
  21. Koole, G. and E. van der Sluis. (2003). “Optimal Shift Scheduling with a Global Service Level Constraint.” IIE Transactions 35(11), 1049-1055.Google Scholar
  22. Law, A.M. and W.D. Kelton. (2000). Simulation Modeling and Analysis, 3rd ed. Boston, MA: McGraw-Hill.Google Scholar
  23. Mehrotra, A., K.E. Murphy, and M.A. Trick. (2000). “Optimal Shift Scheduling: A Branch-and-Price Approach.” Naval Research Logistics 47(3), 185-200.Google Scholar
  24. Morito, S., J. Koida, T. Iwama, M. Sato, and Y. Tamura. (1999). “Simulation-Based Constraint Generation with Applications to Optimization of Logistic System Design.” In P.A. Farrington, H.B. Nembhard, D.T. Sturrock, and G.W. Ewans (eds.), Proceedings of the 1999 Winter Simulation Conference, pp. 531-536. Piscataway, NJ: IEEE.Google Scholar
  25. Murty, K.G. (1988). Linear Complementarity, Linear and Nonlinear Programming. Berlin: Heldermann.Google Scholar
  26. Robinson, S.M. (1996). “Analysis of Sample-Path Optimization.” Mathematics of Operations Research 21(3), 513-528.Google Scholar
  27. Rockafellar, R.T. (1970). Convex Analysis. Princeton, NJ: Princeton University Press.Google Scholar
  28. Rubenstein, R.Y. and A. Shapiro. (1993). Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method. Chichester: Wiley.Google Scholar
  29. Shapiro, A. and T. Homem-de-Mello. (2000). “On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs.” SIAM Journal on Optimization 11(1), 70-86.Google Scholar
  30. Thompson, G.M. (1997). “Labor Staffing and Scheduling Models for Controlling Service Levels.” Naval Research Logistics 44(8), 719-740.Google Scholar
  31. van Slyke, R.M. and R. Wets. (1969). “L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming.” SIAM Journal on Applied Mathematics 17(4), 638-663.Google Scholar
  32. Vogel, S. (1988). “Stability Results for Stochastic Programming Problems.” Optimization 19(2), 269-288.Google Scholar
  33. Vogel, S. (1994). “A Stochastic Approach to Stability in Stochastic Programming.” Journal of Computational and Applied Mathematics 56, 65-96.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Júlíus Atlason
    • 1
  • Marina A. Epelman
    • 1
  • Shane G. Henderson
    • 2
  1. 1.Department of Industrial and Operations EngineeringUniversity of MichiganAnn ArborUSA
  2. 2.School of Operations Research and Industrial EngineeringCornell UniversityIthacaUSA

Personalised recommendations