IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v16y2014i2p220-237.html
   My bibliography  Save this article

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

Author

Listed:
  • Dongyuan Zhan

    (Marshall School of Business, University of Southern California, Los Angeles, California 90089)

  • Amy R. Ward

    (Marshall School of Business, University of Southern California, Los Angeles, California 90089)

Abstract

In a call center, agents may handle calls at different speeds, and also may be more or less successful at resolving customers' inquiries, even when only considering customers calling with similar requests. One common measure of successful call resolution is whether or not the call results in the customer calling back. This presents a natural trade-off between speed and quality, where speed is defined as the average time before an incoming call is answered (the average waiting time) and quality is defined as the percentage of all arriving calls that do not result in callbacks (the call resolution). The relevant control is the routing, that is, the decision concerning which agent should handle an arriving call when more than one agent is available. In an inverted-V model setting, we formulate an optimization problem with the dual performance objective of minimizing average customer waiting time and maximizing the call resolution. We solve this optimization problem asymptotically in the Halfin–Whitt many-server limit regime, interpret its solution as a routing control for the discrete-event system, and show via simulation that the interpreted routing control is on the efficient frontier. In particular, any routing control that has a lower average waiting time (higher call resolution) must also have a lower call resolution (higher average waiting time).

Suggested Citation

  • Dongyuan Zhan & Amy R. Ward, 2014. "Threshold Routing to Trade Off Waiting and Call Resolution in Call Centers," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 220-237, May.
    • Handle: RePEc:inm:ormsom:v:16:y:2014:i:2:p:220-237
    DOI: 10.1287/msom.2013.0463
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2013.0463
    Download Restriction: no
    File URL: https://libkey.io/10.1287/msom.2013.0463?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    2. J. Michael Harrison & Assaf Zeevi, 2004. "Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime," Operations Research, INFORMS, vol. 52(2), pages 243-257, April.
    3. Lauren Xiaoyuan Lu & Jan A. Van Mieghem & R. Canan Savaskan, 2009. "Incentives for Quality Through Endogenous Routing," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 254-273, July.
    4. William S. Lovejoy & Kannan Sethuraman, 2000. "Congestion and Complexity Costs in a Plant with Fixed Resources that Strives to Make Schedule," Manufacturing & Service Operations Management, INFORMS, vol. 2(3), pages 221-239, February.
    5. Vijay Mehrotra & Kevin Ross & Geoff Ryder & Yong-Pin Zhou, 2012. "Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers," Manufacturing & Service Operations Management, INFORMS, vol. 14(1), pages 66-81, January.
    6. Ohad Perry & Ward Whitt, 2009. "Responding to Unexpected Overloads in Large-Scale Service Systems," Management Science, INFORMS, vol. 55(8), pages 1353-1367, August.
    7. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    8. Lawrence Brown & Noah Gans & Avishai Mandelbaum & Anat Sakov & Haipeng Shen & Sergey Zeltyn & Linda Zhao, 2005. "Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective," Journal of the American Statistical Association, American Statistical Association, vol. 100, pages 36-50, March.
    9. Saed Alizamir & Francis de Véricourt & Peng Sun, 2013. "Diagnostic Accuracy Under Congestion," Management Science, INFORMS, vol. 59(1), pages 157-171, December.
    10. Avishai Mandelbaum & Petar Momčilović & Yulia Tseytlin, 2012. "On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers," Management Science, INFORMS, vol. 58(7), pages 1273-1291, July.
    11. Alessandro Arlotto & Stephen E. Chick & Noah Gans, 2014. "Optimal Hiring and Retention Policies for Heterogeneous Workers Who Learn," Management Science, INFORMS, vol. 60(1), pages 110-129, January.
    12. Francis de Véricourt & Yong-Pin Zhou, 2005. "Managing Response Time in a Call-Routing Problem with Service Failure," Operations Research, INFORMS, vol. 53(6), pages 968-981, December.
    13. Krishnan S. Anand & M. Faz{i}l Paç & Senthil Veeraraghavan, 2011. "Quality-Speed Conundrum: Trade-offs in Customer-Intensive Services," Management Science, INFORMS, vol. 57(1), pages 40-56, January.
    14. Sem Borst & Avi Mandelbaum & Martin I. Reiman, 2004. "Dimensioning Large Call Centers," Operations Research, INFORMS, vol. 52(1), pages 17-34, February.
    15. Ohad Perry & Ward Whitt, 2011. "A Fluid Approximation for Service Systems Responding to Unexpected Overloads," Operations Research, INFORMS, vol. 59(5), pages 1159-1170, October.
    16. Tolga Tezcan & J. G. Dai, 2010. "Dynamic Control of N -Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic," Operations Research, INFORMS, vol. 58(1), pages 94-110, February.
    17. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Galit B. Yom-Tov & Avishai Mandelbaum, 2014. "Erlang-R: A Time-Varying Queue with Reentrant Customers, in Support of Healthcare Staffing," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 283-299, May.
    2. Tinglong Dai & Ronghuo Zheng & Katia Sycara, 2020. "Jumping the Line, Charitably: Analysis and Remedy of Donor-Priority Rule," Management Science, INFORMS, vol. 66(2), pages 622-641, February.
    3. Xuchuan Yuan & Tinglong Dai & Lucy Gongtao Chen & Srinagesh Gavirneni, 2021. "Co-Opetition in Service Clusters with Waiting-Area Entertainment," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 106-122, 1-2.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    2. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    3. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    4. Wyean Chan & Ger Koole & Pierre L'Ecuyer, 2014. "Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 544-560, October.
    5. Ragavendran Gopalakrishnan & Sherwin Doroudi & Amy R. Ward & Adam Wierman, 2016. "Routing and Staffing When Servers Are Strategic," Operations Research, INFORMS, vol. 64(4), pages 1033-1050, August.
    6. Tom F. Tan & Bradley R. Staats, 2020. "Behavioral Drivers of Routing Decisions: Evidence from Restaurant Table Assignment," Production and Operations Management, Production and Operations Management Society, vol. 29(4), pages 1050-1070, April.
    7. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    8. Jim G. Dai & Pengyi Shi, 2021. "Recent Modeling and Analytical Advances in Hospital Inpatient Flow Management," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1838-1862, June.
    9. Tom Fangyun Tan & Serguei Netessine, 2014. "When Does the Devil Make Work? An Empirical Study of the Impact of Workload on Worker Productivity," Management Science, INFORMS, vol. 60(6), pages 1574-1593, June.
    10. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    11. Alexander L. Stolyar & Tolga Tezcan, 2011. "Shadow-Routing Based Control of Flexible Multiserver Pools in Overload," Operations Research, INFORMS, vol. 59(6), pages 1427-1444, December.
    12. Opher Baron & Joseph Milner, 2009. "Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements," Operations Research, INFORMS, vol. 57(3), pages 685-700, June.
    13. Tolga Tezcan & J. G. Dai, 2010. "Dynamic Control of N -Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic," Operations Research, INFORMS, vol. 58(1), pages 94-110, February.
    14. Eugene Furman & Adam Diamant & Murat Kristal, 2021. "Customer Acquisition and Retention: A Fluid Approach for Staffing," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4236-4257, November.
    15. Avishai Mandelbaum & Petar Momčilović, 2008. "Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 561-586, August.
    16. Philipp Afèche & Mojtaba Araghi & Opher Baron, 2017. "Customer Acquisition, Retention, and Service Access Quality: Optimal Advertising, Capacity Level, and Capacity Allocation," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 674-691, October.
    17. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    18. Vasiliki Kostami & Sampath Rajagopalan, 2014. "Speed–Quality Trade-Offs in a Dynamic Model," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 104-118, February.
    19. Guodong Pang & Ward Whitt, 2009. "Service Interruptions in Large-Scale Service Systems," Management Science, INFORMS, vol. 55(9), pages 1499-1512, September.
    20. Gad Allon & Itai Gurvich, 2010. "Pricing and Dimensioning Competing Large-Scale Service Providers," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 449-469, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:16:y:2014:i:2:p:220-237. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.