Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach

Published Online:https://doi.org/10.1287/mnsc.1100.1173

References

  • Akşin Z., Armony M., Mehrotra V. A multidisciplinary perspective on operations management research. Production Oper. Management (2008) 16(6):655–688Google Scholar
  • Armony M. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems (2005) 51(3–4):287–329CrossrefGoogle Scholar
  • Armony M., Mandelbaum A. Routing and staffing in large-scale service systems: The case of homogeneous impatient customers and heterogeneous servers. Oper. Res. (2010) . ForthcomingLinkGoogle Scholar
  • Atlason J., Epelman M. A., Henderson S. G. Optimizing call center staffing using simulation and analytic center cutting-plane methods. Management Sci. (2008) 54(2):295–309LinkGoogle Scholar
  • Bassamboo A., Zeevi A. Staffing telephone call centers subject to service-level constraints: An approximate approach via constraint dualization. (2008) . Working paper, Northwestern University, Evanston, ILGoogle Scholar
  • Bassamboo A., Harrison J. M., Zeevi A. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. (2006a) 54(3):419–435LinkGoogle Scholar
  • Bassamboo A., Harrison J. M., Zeevi A. Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits. Queueing Systems (2006b) 52(3–4):249–285CrossrefGoogle Scholar
  • Bassamboo A., Randhawa R., Zeevi A. Capacity planning in service systems with arrival rate uncertainty: Safety staffing principles revisited. (2008) . Working paper, Northwestern University, Evanston, ILGoogle Scholar
  • Bertsimas D., Doan X. V. Data-driven and robust optimization approaches to call centers. (2009) . Working paper, Massachusetts Institute of Technology, CambridgeGoogle Scholar
  • Borst S., Mandelbaum A., Reiman M. I. Dimensioning large call centers. Oper. Res. (2004) 52(1):17–34LinkGoogle Scholar
  • Brown L., Gans N., Mandelbaum A., Sakov A., Shen H., Zeltyn S., Zhao L. Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. (2005) 100(469):36–50CrossrefGoogle Scholar
  • Calafiore G. C., Campi M. C. Uncertain convex programs: Randomized solutions and confidence levels. Math. Program. (2005) 102(1):25–46CrossrefGoogle Scholar
  • Cezik M. T., L'Ecuyer P. Staffing multiskill call centers via linear programming and simulation. Management Sci. (2008) 54(2):310–323LinkGoogle Scholar
  • Chen B. P. K., Henderson S. G. Two issues in setting call center staffing levels. Ann. Oper. Res. (2001) 108(1–4):175–192CrossrefGoogle Scholar
  • Dai J. G., Tezcan T. Optimal control of parallel server systems with many servers in heavy traffic. Queueing Systems (2008) 59(2):95–134CrossrefGoogle Scholar
  • Dai J. G., Tezcan T. State space collapse in many-server diffusion limits of parallel server systems. Math. Oper. Res. (2010) . ForthcomingGoogle Scholar
  • Dentcheva D., Prékopa A., Ruszczyński A. Concavity and efficient points of discrete distributions in probabilistic programming. Math. Programming (2000) 89(1):55–77CrossrefGoogle Scholar
  • Deslauriers A., Lécuyer P., Pichitlamken J., Ingolfsson A., Avramidis A. N. Markov chain models of a telephone call center in blend mode. Comput. Oper. Res. (2007) 34(6):1616–1645CrossrefGoogle Scholar
  • Erdoğan E., Iyengar G. On two-stage convex chance constrained problems. Math. Methods Oper. Res. (2007) 65(1):115–140CrossrefGoogle Scholar
  • Feldman Z. Optimal staffing of systems with skills-based-routing. (2008) . MSc Thesis, Technion–Israel Institute of Technology, HaifaGoogle Scholar
  • Feldman Z., Gurvich I., Whitt W. Managing quality of service in call centers via queue-ratio routing: Asymptotic analysis and simulation-based optimization. (2009) . Working paper, Northwestern University, Evanston, ILGoogle Scholar
  • Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management (2003) 5(2):79–141LinkGoogle Scholar
  • Gans N., Shen H., Zhou Y.-P., Korolev K., McCord A., Ristock H. Parametric stochastic programming models for call-center workforce scheduling. (2009) . Working paper, University of Pennsylvania, PhiladelphiaGoogle Scholar
  • Gurvich I., Whitt W. Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. (2010) 58(2):316–328LinkGoogle Scholar
  • Gurvich I., Armony M., Mandelbaum A. Service-level differentiation in call centers with fully flexible servers. Management Sci. (2008) 54(2):279–294LinkGoogle Scholar
  • Küçükyavuz S. On mixing sets arising in chance-constrained programming. (2010) . Technical report, Industrial and Systems Engineering, Ohio State University, ColumbusGoogle Scholar
  • Luedtke J. An integer programming and decomposition approach to general chance-constrained mathematical programs. 14th Conf. on Integer Programming and Combinatorial Optimization (IPCO 2010) (2010) Lausanne, SwitzerlandForthcomingCrossrefGoogle Scholar
  • Luedtke J., Ahmed S. A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. (2008) 19(2):674–699CrossrefGoogle Scholar
  • Luedtke J., Ahmed S., Nemhauser G. L. An integer programming approach for linear programs with probabilistic constraints. Math. Programming (2010) 122(2):247–272CrossrefGoogle Scholar
  • Maman S., Mandelbaum A., Zeltyn S. Uncertainty in the demand for service: The case of call centers and emergency departments. (2008) . Working paper, Technion–Israeli Institute of Technology, HaifaGoogle Scholar
  • Mandelbaum A., Zeltyn S. Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Oper. Res. (2009) 57(5):1189–1205LinkGoogle Scholar
  • Mehrotra V., Ozluk O., Saltzman R. Intelligent procedures for intra-day updating of call center agent schedules. Production Oper. Management (2010) . ForthcomingGoogle Scholar
  • Nemirovski A., Shapiro A., Calafiore G., Dabbene F. Scenario approximation of chance constraints. Probabilistic and Randomized Methods for Design Under Uncertainty (2005) (Springer, London) 3–48Google Scholar
  • Prékopa A., Rusczyński A., Shapiro A. Probabilistic Programming. Stochastic Programming, Handbooks in Operations Research and Management Science (2003) 10(Elsevier Science B.V., Amsterdam) 267–351CrossrefGoogle Scholar
  • Pucci de Farias D., Van Roy B. On constraint sampling in the linear programming approach to approximate dynamic programming. Math. Oper. Res. (2004) 29(3):462–478LinkGoogle Scholar
  • Robins T. R., Harrison T. P. Call center scheduling with uncertain arrivals and global service level agreements. (2008) . Working paper, Pennsylvania State University, University ParkGoogle Scholar
  • Rockafellar R. T., Uryasev S. Optimization of conditional value-at-risk. J. Risk (2000) 2(2):21–42CrossrefGoogle Scholar
  • Ruszczyński A. Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math. Programming (2002) 93(2):195–215CrossrefGoogle Scholar
  • Shapiro A., Dentcheva D., Ruszczyński A.Lectures on Stochastic Programming: Modeling and Theory (2009) (SIAM, Philadelphia) CrossrefGoogle Scholar
  • Shen H., Huang J. Z. Forecasting time series of inhomogeneous Poisson processes with application to call center workforce management. Ann. Appl. Statist. (2008a) 2(2):601–623CrossrefGoogle Scholar
  • Shen H., Huang J. Z. Interday forecasting and intraday updating of call center arrivals. Manufacturing Service Oper. Management (2008b) 10(3):391–410LinkGoogle Scholar
  • Soyer R., Tarimcilar M. M. Modeling and analysis of call center arrival data: A Bayesian approach. Management Sci. (2008) 54(2):266–278LinkGoogle Scholar
  • Stolyar A. L., Tezcan T. Control of systems with flexible multi-server pools: A shadow routing approach. (2008) . Working paper, University of Illinois at Urbana–Champaign, UrbanaGoogle Scholar
  • Tanner M. W., Ntaimo L. IIS branch-and-cut for joint chance-constrained programs with random technology matrices. Eur. J. Oper. Res. (2010) . ForthcomingCrossrefGoogle Scholar
  • Taylor J. W. A comparison of univariate time series methods for forecasting intraday arrivals at a call center. Management Sci. (2008) 54(2):253–265LinkGoogle Scholar
  • Wallace R. B., Whitt W. A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management (2005) 7(4):276–294LinkGoogle Scholar
  • Weinberg J., Brown L. D., Stroud J. R. Bayesian forecasting of an inhomogeneous Poisson process with applications to call center data. J. Amer. Statist. Assoc. (2007) 102(480):1185–1198CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.