Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty

References

• Aksin OZ, Armony M, Mehrotra V (2007a) The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6):665–688.Crossref, Google Scholar
• Aksin OZ, Karaesmen F, Örmeci EL (2007b) Workforce cross training in call centers from an operations management perspective. Nembhard DA, ed. Workforce Cross Training (CRC Press, Boca Raton, FL), 211–240.Crossref, Google Scholar
• Atar R (2005) Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 15(4):2606–2650.Crossref, Google Scholar
• Atlason J, Epelman MA, Henderson SG (2004) Call center staffing with simulation and cutting plane methods. Ann. Oper. Res. 127:333–358.Crossref, Google Scholar
• Atlason J, Epelman MA, Henderson SG (2008) Optimizing call center staffing using simulation and analytic center cutting-plane methods. Management Sci. 54(2):295–309.Link, Google Scholar
• Avramidis AN, Chan W, L’Ecuyer P (2009) Staffing multi-skill call centers via search methods and a performance approximation. IIE Trans. 41(6):483–497.Crossref, Google Scholar
• Avramidis AN, Chan W, Gendreau M, L’Ecuyer P, Pisacane O (2010) Optimizing daily agent scheduling in a multiskill call center. Eur. J. Oper. Res. 200(3):822–832.Crossref, Google Scholar
• Bassamboo A, Zeevi A (2009) On a data-driven method for staffing large call centers. Oper. Res. 57(3):714–726.Link, Google Scholar
• Bassamboo A, Harrison JM, Zeevi A (2006) Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54(3):419–435.Link, Google Scholar
• Batun S, Denton BT, Huschka TR, Schaefer AJ (2011) Operating room pooling and parallel surgery processing under uncertainty. INFORMS J. Comput. 23(2):220–237.Link, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Bhulai S, Koole G, Pot A (2008) Simple methods for shift scheduling in multiskill call centers. Manufacturing Service Oper. Management 10(3):411–420.Link, Google Scholar
• Birge JR, Louveaux F (1997) Introduction to Stochastic Programming (Springer, New York).Google Scholar
• Borst S, Mandelbaum A, Reiman M (2004) Dimensioning large call centers. Oper. Res. 52(1):17–34.Link, Google Scholar
• Brown L, Gans N, Mandelbaum A, Sakov A, Shen H, Zeltyn S, Zhao L (2005) Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100(469):36–50.Crossref, Google Scholar
• Carøe CC (1998) Decomposition in stochastic integer programming. Ph.D. thesis, Department of Operations Research, University of Copenhagen, Denmark.Google Scholar
• Carøe CC, Schultz R (1999) Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1–2):37–45.Crossref, Google Scholar
• Carøe CC, Tind J (1998) L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Program. 83(1):451–464.Crossref, Google Scholar
• Cezik MT, L’Ecuyer P (2008) Staffing multiskill call centers via linear programming and simulation. Management Sci. 54(2):310–323.Link, Google Scholar
• Chan W, Koole G, L’Ecuyer P (2014) Dynamic call center routing policies using call waiting and agent idle times. Manufacturing Service Oper. Management 16(4):544–560.Link, Google Scholar
• Dai JG, Tezcan T (2008) Optimal control of parallel server systems with many servers in heavy traffic. Queueing Systems 59(2):95–134.Crossref, Google Scholar
• Dai L, Chen CH, Birge JR (2000) Convergence properties of two-stage stochastic programming. J. Optim. Theory Appl. 106(3):489–509.Crossref, Google Scholar
• Ehrgott M (2005) Multicriteria Optimization, 2nd ed. (Springer, Berlin).Google Scholar
• Feldman Z, Mandelbaum A (2010) Using simulation-based stochastic approximation to optimize staffing of systems with skills-based routing. Johansson B, Jain S, Montoya-Torres J, Hugan J, Yücesan E, eds. Proc. Winter Simulation Conf. (IEEE, Washington, DC), 3307–3317.Crossref, Google Scholar
• Feldman Z, Mandelbaum A, Massey WA, Whitt W (2008) Staffing of time-varying queues to achieve time-stable performance. Management Sci. 54(2):324–338.Link, Google Scholar
• Gade D, Küçükyavuz S, Sen S (2014) Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math. Programming, Ser. A 144(1):39–64.Crossref, Google Scholar
• Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2):79–141.Link, Google Scholar
• Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3):208–227.Link, Google Scholar
• Guedj I, Mandelbaum A (2000) “Anonymous bank” call-center data. Accessed September 7, 2013. http://iew3.technion.ac.il/serveng/callcenterdata/index.html.Google Scholar
• Gurvich I, Whitt W (2009) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2):363–396.Link, Google Scholar
• Gurvich I, Whitt W (2010) Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. 58(2):316–328.Link, Google Scholar
• Gurvich I, Luedtke J, Tezcan T (2010) Staffing call centers with uncertain demand forecasts: A chance-constrained optimization approach. Management Sci. 56(7):1093–1115.Link, Google Scholar
• Harrison JM, Zeevi A (2005) A method for staffing large call centers based on stochastic fluid models. Manufacturing Service Oper. Management 7(1):20–36.Link, Google Scholar
• Henderson SG, Mason AJ (1998) Rostering by iterating integer programming and simulation. Medeiros DJ, Watson EF, Carson JS, Manivannan MS, eds. Proc. 30th Winter Simulation Conf. (IEEE Computer Society, Los Alamitos, CA), 677–684.Crossref, Google Scholar
• Ingolfsson A, Campello F, Wu X, Cabral E (2010) Combining integer programming and the randomization method to schedule employees. Eur. J. Oper. Res. 202(1):153–163.Crossref, Google Scholar
• Jennings O, Mandelbaum A, Massey W, Whitt W (1996) Server staffing to meet time-varying demand. Management Sci. 42(10):1383–1394.Link, Google Scholar
• Jordan WC, Graves SC (1995) Principles on the benefits of manufacturing process flexibility. Management Sci. 41(4):577–594.Link, Google Scholar
• Kim K, Mehrotra S (2015) A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management. Oper. Res. 63(6):1431–1451.Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kolesar PJ, Green LV (1998) Insights on service system design from a normal approximation to Erlang’s delay formula. Production Oper. Management 7(3):282–293.Crossref, Google Scholar
• Koole G, Mandelbaum A (2002) Queueing models of call centers: An introduction. Ann. Oper. Res. 113(1–4):41–59.Crossref, Google Scholar
• Koole G, Pot A (2006) An overview of routing and staffing algorithms in multi-skill customer contact centers. Technical Report WS2006-1, Vrije Universiteit Amsterdam, Netherlands.Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• L’Ecuyer P (2006) Modeling and optimization problems in contact centers. Proc. Third Internat. Conf. Quant. Evaluation of Systems (IEEE Computer Society, Washington, DC), 145–156.Google Scholar
• Mandelbaum A, Stolyar A (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.Link, Google Scholar
• Mandelbaum A, Zeltyn S (2009) Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Oper. Res. 57(5):1189–1205.Link, Google Scholar
• Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization (Wiley, New York).Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1990) A recursive procedure to generate all cuts for 0–1 mixed integer programs. Math. Programming 46(1–3):379–390.Crossref, Google Scholar
• Ntaimo L (2013) Fenchel decomposition for stochastic mixed-integer programming. J. Global. Optim. 55(1):141–163.Crossref, Google Scholar
• Pot A, Bhulai S, Koole G (2008) A simple staffing method for multiskill call centers. Manufacturing Service Oper. Management 10(3):421–428.Link, Google Scholar
• Robbins TR, Harrison TP (2008) A simulation based scheduling model for call centers with uncertain arrival rates. Mason SJ, Hill RR, Moench L, Rose O, Jefferson T, Fowler JW, eds. Proc. 40th Conf. Winter Simulation (IEEE Computer Society, Washington, DC), 2884–2890.Crossref, Google Scholar
• Robbins TR, Harrison TP (2010) A stochastic programming model for scheduling call centers with global service level agreements. Eur. J. Oper. Res. 207(3):1608–1619.Crossref, Google Scholar
• Sen S, Higle JL (2005) The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math. Program. 104(1):1–20.Crossref, Google Scholar
• Sen S, Sherali HD (2006) Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Program. 106(2):203–223.Crossref, Google Scholar
• Shen H, Huang JZ (2008a) Forecasting time series of inhomogeneous Poisson processes with application to call center workforce management. Ann. Appl. Statist. 2(2):601–623.Crossref, Google Scholar
• Shen H, Huang JZ (2008b) Interday forecasting and intraday updating of call center arrivals. Manufacturing Service Oper. Management 10(3):391–410.Link, Google Scholar
• Stolyar AL (2005a) Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Syst. 50(4):401–457.Crossref, Google Scholar
• Stolyar AL (2005b) Optimal routing in output-queued flexible server systems. Probab. Engrg. Informational Sci. 19(2):141–189.Crossref, Google Scholar
• Stolyar AL, Tezcan T (2010) Control of systems with flexible multi-server pools: A shadow routing approach. Queueing Syst. 66(1):1–51.Crossref, Google Scholar
• Stolyar AL, Tezcan T (2011) Shadow-routing based control of flexible multiserver pools in overload. Oper. Res. 59(6):1427–1444.Link, Google Scholar
• Tanner MW, Ntaimo L (2008) Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs. J. Global. Optim. 41(3):365–384.Crossref, Google Scholar
• Thompson GM (1997) Labor staffing and scheduling models for controlling service levels. Naval Res. Logist. 44(8):719–740.Crossref, Google Scholar
• Van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4):638–663.Crossref, Google Scholar
• Wallace RB, Whitt W (2005) A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management 7(4):276–294.Link, Google Scholar
• Ward AR, Armony M (2013) Blind fair routing in large-scale service systems with heterogeneous customers and servers. Oper. Res. 61(1):228–243.Link, Google Scholar
• Weinberg J, Brown LD, Stroud JR (2007) Bayesian forecasting of an inhomogeneous Poisson process with applications to call center data. J. Amer. Statist. Assoc. 102(480):1185–1198.Crossref, Google Scholar
• Whitt W (2006) Staffing a call center with uncertain arrival rate and absenteeism. Production Oper. Management 15(1):88–102.Crossref, Google Scholar
• Wolsey LA (1998) Integer Programming (Wiley, New York).Google Scholar
• Ye H, Luedtke J, Shen H (2014) Forecasting and staffing call centers with multiple interdependent uncertain arrival streams. Working paper, University of North Carolina, Chapel Hill.Google Scholar
• Zhang M, Küçükyavuz S (2014) Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J. Optim. 24(4):1933–1951.Crossref, Google Scholar