Threshold Routing to Trade Off Waiting and Call Resolution in Call Centers

References

• Aksin Z, Armony M, Mehrotra V (2007) The modern call-center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6):655–688.Google Scholar
• Alizamir S, de Vericourt F, Sun P (2013) Diagnostic accuracy under congestion. Management Sci. 59(1):157–171.Link, Google Scholar
• Anand KS, Paç MF, Veeraraghavan S (2011) Quality-speed conundrum: Trade-offs in customer-intensive services. Management Sci. 57(1):40–56.Link, Google Scholar
• Arlotto A, Chick SE, Gans N (2014) Optimal hiring and retention policies for heterogeneous workers who learn. Management Sci. 60(1):110–129.Link, Google Scholar
• Armony M (2005) Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems 51(3–4):287–329.Crossref, Google Scholar
• Armony M, Ward A (2010) Fair dynamic routing in large-scale heterogeneous-server systems. Oper. Res. 58(3):624–637.Link, Google Scholar
• Atar R (2005) Scheduling control for queueing systems with many servers. Ann. Appl. Probab. 15(4):2606–2650.Crossref, Google Scholar
• Atar R (2008) Central limit theorem for a many-server queue with random service rates. Ann. Appl. Probab. 18(4):1548–1568.Crossref, Google Scholar
• Atar R, Mandelbaum A, Reiman MI (2004) Scheduling a multi class queue with many exponential servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 14(3):1084–1134.Crossref, Google Scholar
• Borst S, Mandelbaum A, Reiman MI (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
• Chan CW, Yom-Tov G, Escobar G (2012) When to use speedup? An examination of service systems with returns. Working paper, Columbia University, New York.Google Scholar
• de Vericourt F, Zhou Y (2005) Managing response time in a call-routing problem with service failure. Oper. Res. 53(6):968–981.Link, 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
• Gurvich I, Whitt W (2009a) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2):363–396.Link, Google Scholar
• Gurvich I, Whitt W (2009b) Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2):237–253.Link, Google Scholar
• Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.Link, Google Scholar
• Harrison JM, Zeevi A (2004) Dynamic scheduling of a multiclass queue in the Halfin and Whitt heavy traffic regime. Oper. Res. 52(2):243–257.Link, Google Scholar
• Hart M, Fichtner B, Fjalestad E, Langley S (2006) Contact centre performance: In pursuit of first call resolution. Management Dynam. 15(4):17–28.Google Scholar
• Kostami V, Rajagopalan S (2014) Speed–quality trade-offs in a dynamic model. Manufacturing Service Oper. Management 16(1):104–118.Link, Google Scholar
• Lovejoy WS, Sethuraman K (2000) Congestion and complexity costs in a plant with fixed resources that strives to make schedule. Manufacturing Service Oper. Management 2(3):221–239.Link, Google Scholar
• Lu L, Van Mieghem J, Savaskan C (2009) Incentives for quality through endogenous routing. Manufacturing Service Oper. Management 11(2):254–273.Link, Google Scholar
• Mandelbaum A, Momcilovic P, Tseytlin Y (2012) On fair routing from emergency departments to hospital wards: QED queues with heterogeneous servers. Management Sci. 58(7):1273–1291.Link, Google Scholar
• Mehrotra V, Ross K, Ryder G, Zhou Y (2012) Routing to manage resolution and waiting time in call centers with heterogeneous servers. Manufacturing Service Oper. Management 14(1):66–81.Link, Google Scholar
• Perry O, Whitt W (2009) Responding to unexpected overloads in large-scale service systems. Management Sci. 55(8):1353–1367.Link, Google Scholar
• Perry O, Whitt W (2011) A fluid approximation for service systems responding to unexpected overloads. Oper. Res. 59(5):1159–1170.Link, Google Scholar
• Tezcan T, Dai J (2010) Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. 58(1):94–110.Link, Google Scholar
• Ward A, 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
• Weerasinghe A, Mandelbaum A (2013) Abandonment versus blocking in many-server queues: Asymptotic optimality in the QED regime. Queueing Systems 75(2–4):279–337.Crossref, Google Scholar