Routing and Staffing in Customer Service Chat Systems with Generally Distributed Service and Patience Times

References

• Altman D, Yom-Tov GB, Olivares M, Ashtar S, Rafaeli A (2021) Do customer emotions affect agent speed? An empirical study of emotional load in online customer contact centers. Manufacturing Service Oper. Management 23(4):854–875.Link, Google Scholar
• Armony M, Ward AR (2010) Fair dynamic routing in large-scale heterogeneous-server systems. Oper. Res. 58(3):624–637.Link, Google Scholar
• Bassamboo A, Randhawa RS (2016) Scheduling homogeneous impatient customers. Management Sci. 62(7):2129–2147.Link, Google Scholar
• Bassamboo A, Randhawa RS, Zeevi A (2010) Capacity sizing under parameter uncertainty: Safety staffing principles revisited. Management Sci. 56(10):1668–1686.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
• Campello F, Ingolfsson A, Shumsky RA (2017) Queueing models of case managers. Management Sci. 63(3):882–900.Link, Google Scholar
• Castellanos A, Yom-Tov GB, Goldberg Y (2021) Silent abandonment in contact centers: Estimating customer patience from uncertain data. Technical report, Technion–Israel Institute of Technology, Haifa, Israel.Google Scholar
• Cui L, Tezcan T (2016) Approximations for chat service systems using many-server diffusion limits. Math. Oper. Res. 41(3):775–807.Link, Google Scholar
• Daw A, Castellanos A, Yom-Tov GB, Pender J, Gruendlinger L (2021) The co-production of service: Modeling service times in contact centers using Hawkes processes. Technical report, Technion–Israel Institute of Technology, Haifa, Israel.Google Scholar
• Dobson G, Tezcan T, Tilson V (2013) Optimal workflow decisions for investigators in systems with interruptions. Management Sci. 59(5):1125–1141.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
• 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
• Goes PB, Ilk N, Lin M, Zhao JL (2018) When more is less: Field evidence on unintended consequences of multitasking. Management Sci. 64(7):3033–3054.Link, Google Scholar
• Gromoll HC (2004) Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14(2):555–611.Crossref, Google Scholar
• Gromoll HC, Puha AL, Williams RJ (2002) The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12(3):797–859.Crossref, Google Scholar
• Gromoll HC, Robert P, Zwart B (2008) Fluid limits for processor sharing queues with impatience. Math. Oper. Res. 33(2):375–402.Link, Google Scholar
• Harrison JM (2000) Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10(1):75–103.Crossref, Google Scholar
• ICMI (2013) Extreme engagement in the multichannel contact center: Leveraging the emerging channels research report and best practices guide. ICMI Research Report, London.Google Scholar
• International T (2011) Best practices: Online chat sales. Benchmarking study—White paper.Google Scholar
• Kaspi H, Ramanan K (2011) Law of large numbers limits for many-server queues. Ann. Appl. Probab. 21(1):33–114.Crossref, Google Scholar
• Leenen W (2016) Demand forecasting and hierarchical workforce staffing in customer service chat (CSC) centres. Unpublished master’s thesis, Eindhoven University of Technology, Netherlands.Google Scholar
• Legros B, Jouini O (2019) On the scheduling of operations in a chat contact center. Eur. J. Oper. Res. 274(1):303–316.Crossref, Google Scholar
• Liu Y, Whitt W (2014) Algorithms for time-varying networks of many-server fluid queues. INFORMS J. Comput. 26(1):59–73.Link, Google Scholar
• Long Z, Shimkin N, Zhang H, Zhang J (2020) Dynamic scheduling of multiclass many-server queues with abandonment: The generalized cμ/h rule. Oper. Res. 68(4):1218–1230.Link, Google Scholar
• Long Z, Zhang H, Zhang J, Zhang ZG (2024) The generalized c/μ rule for queues with heterogeneous server pools. Oper. Res. Forthcoming.Google Scholar
• Luo J, Zhang J (2013) Staffing and control of instant messaging contact centers. Oper. Res. 61(2):328–343.Link, Google Scholar
• Mandelbaum A, Momčilović 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
• McLean G, Osei-Frimpong K (2017) Examining satisfaction with the experience during a live chat service encounter-implications for website providers. Comput. Human Behav. 76:494–508.Crossref, Google Scholar
• Puha AL, Williams RJ (2004) Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Ann. Appl. Probab. 14(2):517–554.Crossref, Google Scholar
• Rafaeli A, Altman D, Yom-Tov GB (2019) Cognitive and emotional load influence response time of customer-service agents: A large scale analysis of chat service conversations. Bui TX, ed. Proc. 52nd Hawaii Internat. Conf. System Sci., HICSS 2019 (ScholarSpace, Honolulu), 1906–1915.Google Scholar
• Tezcan T, Zhang J (2014) Routing and staffing in customer service chat systems with impatient customers. Oper. Res. 62(4):943–956.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
• Whitt W (2006) Fluid models for multiserver queues with abandonments. Oper. Res. 54(1):37–54.Link, Google Scholar
• Williams RJ (1998) Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems 30(1–2):27–88.Crossref, Google Scholar
• Wu CA, Bassamboo A, Perry O (2019) Service system with dependent service and patience times. Management Sci. 65(3):1151–1172.Link, Google Scholar
• Yom-Tov G, Mandelbaum A (2014) Erlang-R: A time-varying queue with reentrant customers, in support of healthcare staffing. Manufacturing Service Oper. Management 16(2):283–299.Link, Google Scholar
• Yom-Tov GB, Yedidsion L, Xie Y (2021) An invitation control policy for proactive service systems: Balancing efficiency, value, and service level. Manufacturing Service Oper. Management 23(5):1077–1095.Link, Google Scholar
• Zhang J (2013) Fluid models of many-server queues with abandonment. Queueing Systems 73(2):147–193.Crossref, Google Scholar
• Zhang J, Zwart B (2008) Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Systems 60(3–4):227–246.Crossref, Google Scholar
• Zhang J, Dai JG, Zwart B (2009) Law of large number limits of limited processor-sharing queues. Math. Oper. Res. 34(4):937–970.Link, Google Scholar
• Zhang J, Dai JG, Zwart B (2011) Diffusion limits of limited processor-sharing queues. Ann. Appl. Probab. 21(2):745–799.Crossref, Google Scholar