IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v68y2020i2p327-347.html
   My bibliography  Save this article

An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis

Author

Listed:
  • Barış Ata

    (Booth School of Business, University of Chicago, Chicago, Illinois 60637)

  • Xiaoshan Peng

    (Kelley School of Business, Indiana University, Bloomington, Indiana 47405)

Abstract

This paper studies the callback option as an instrument to effectively mitigate congestion due to temporary surges in arrivals to a call center. The call arrival process can be an arbitrary point process, allowing uncertainty and temporary surges in the arrival rate, provided that the system is stable. When a customer arrives, the call center manager examines the system state and decides whether to offer the incoming customer the callback option. When the callback option is offered, the customer decides whether to accept the offer. The customer is routed to the offline queue (to be called back later) only if he is offered the callback option and accepts it. Otherwise, he is routed to the online queue. For each customer in the online queue, the call center manager incurs a waiting cost of h per time unit. Similarly, whenever she routes a customer to the offline queue (for a callback later), she incurs a one-time penalty of p . Initially, we allow complete foresight policies that look into the entire future. We show that a simple lookahead policy that looks into the future arrivals and service completion times for the next p / h time units and uses the current number of customers in the system who previously rejected a callback offer (but does not look into the accept/reject decisions of future customers) is pathwise optimal. Building on the insights gleaned from the optimal lookahead policies, we also propose a nonanticipating (and implementable) policy by interpreting the lookahead policy in the fluid model and show that it is optimal in the fluid model. In particular, we show that this policy reduces to the so-called line policy, if the arrival rate process follows a Cox-Ingersoll-Ross process. Last, we conduct a simulation study, which shows that the proposed policies perform well.

Suggested Citation

  • Barış Ata & Xiaoshan Peng, 2020. "An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis," Operations Research, INFORMS, vol. 68(2), pages 327-347, March.
  • Handle: RePEc:inm:oropre:v:68:y:2020:i:2:p:327-347
    DOI: 10.1287/opre.2019.1884
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2019.1884
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2019.1884?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. Baric{s} Ata & Shiri Shneorson, 2006. "Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates," Management Science, INFORMS, vol. 52(11), pages 1778-1791, November.
    2. Barış Ata & Tava Lennon Olsen, 2009. "Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs," Operations Research, INFORMS, vol. 57(3), pages 753-768, June.
    3. Linda Green & Peter Kolesar, 1991. "The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals," Management Science, INFORMS, vol. 37(1), pages 84-97, January.
    4. Gabriel Zayas-Cabán & Mark E. Lewis, 2020. "Admission control in a two-class loss system with periodically varying parameters and abandonments," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 175-210, February.
    5. Song-Hee Kim & Ward Whitt & Won Chul Cha, 2018. "A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 181-199, February.
    6. Melanie Rubino & Barış Ata, 2009. "Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations," Operations Research, INFORMS, vol. 57(1), pages 94-108, February.
    7. 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.
    8. Ibrahim, Rouba & Ye, Han & L’Ecuyer, Pierre & Shen, Haipeng, 2016. "Modeling and forecasting call center arrivals: A literature survey and a case study," International Journal of Forecasting, Elsevier, vol. 32(3), pages 865-874.
    9. Amy R. Ward & Sunil Kumar, 2008. "Asymptotically Optimal Admission Control of a Queue with Impatient Customers," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 167-202, February.
    10. 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.
    11. Guodong Pang & Ohad Perry, 2015. "A Logarithmic Safety Staffing Rule for Contact Centers with Call Blending," Management Science, INFORMS, vol. 61(1), pages 73-91, January.
    12. Noah Gans & Haipeng Shen & Yong-Pin Zhou & Nikolay Korolev & Alan McCord & Herbert Ristock, 2015. "Parametric Forecasting and Stochastic Programming Models for Call-Center Workforce Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 571-588, October.
    13. Vasiliki Kostami & Amy R. Ward, 2009. "Managing Service Systems with an Offline Waiting Option and Customer Abandonment," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 644-656, November.
    14. Boris N. Oreshkin & Nazim Réegnard & Pierre L’Ecuyer, 2016. "Rate-Based Daily Arrival Process Models with Application to Call Centers," Operations Research, INFORMS, vol. 64(2), pages 510-527, April.
    15. Yunan Liu & Ward Whitt, 2012. "Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals," Operations Research, INFORMS, vol. 60(6), pages 1551-1564, December.
    16. J. Michael Harrison & Assaf Zeevi, 2005. "A Method for Staffing Large Call Centers Based on Stochastic Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 7(1), pages 20-36, September.
    17. 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.
    18. K. Giesecke & H. Kakavand & M. Mousavi, 2011. "Exact Simulation of Point Processes with Stochastic Intensities," Operations Research, INFORMS, vol. 59(5), pages 1233-1245, October.
    19. Zohar Feldman & Avishai Mandelbaum & William A. Massey & Ward Whitt, 2008. "Staffing of Time-Varying Queues to Achieve Time-Stable Performance," Management Science, INFORMS, vol. 54(2), pages 324-338, February.
    20. Kuang Xu & Carri W. Chan, 2016. "Using Future Information to Reduce Waiting Times in the Emergency Department via Diversion," Manufacturing & Service Operations Management, INFORMS, vol. 18(3), pages 314-331, July.
    21. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    22. Hassin, Refael, 1985. "On the Optimality of First Come Last Served Queues," Econometrica, Econometric Society, vol. 53(1), pages 201-202, January.
    23. Pengyi Shi & Mabel C. Chou & J. G. Dai & Ding Ding & Joe Sim, 2016. "Models and Insights for Hospital Inpatient Operations: Time-Dependent ED Boarding Time," Management Science, INFORMS, vol. 62(1), pages 1-28, January.
    24. Omar Besbes & Costis Maglaras, 2009. "Revenue Optimization for a Make-to-Order Queue in an Uncertain Market Environment," Operations Research, INFORMS, vol. 57(6), pages 1438-1450, December.
    25. Yaşar Levent Koçağa & Mor Armony & Amy R. Ward, 2015. "Staffing Call Centers with Uncertain Arrival Rates and Co-sourcing," Production and Operations Management, Production and Operations Management Society, vol. 24(7), pages 1101-1117, July.
    26. Otis B. Jennings & Avishai Mandelbaum & William A. Massey & Ward Whitt, 1996. "Server Staffing to Meet Time-Varying Demand," Management Science, INFORMS, vol. 42(10), pages 1383-1394, October.
    27. Noah Gans & Yong-Pin Zhou, 2003. "A Call-Routing Problem with Service-Level Constraints," Operations Research, INFORMS, vol. 51(2), pages 255-271, April.
    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. Brett A. Hathaway & Seyed M. Emadi & Vinayak Deshpande, 2021. "Don’t Call Us, We’ll Call You: An Empirical Study of Caller Behavior Under a Callback Option," Management Science, INFORMS, vol. 67(3), pages 1508-1526, March.
    2. 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.

    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. 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.
    2. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    3. Ward Whitt, 2006. "Staffing a Call Center with Uncertain Arrival Rate and Absenteeism," Production and Operations Management, Production and Operations Management Society, vol. 15(1), pages 88-102, March.
    4. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    5. 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.
    6. Ta, Thuy Anh & Chan, Wyean & Bastin, Fabian & L’Ecuyer, Pierre, 2021. "A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty," European Journal of Operational Research, Elsevier, vol. 293(3), pages 966-979.
    7. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    8. 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.
    9. Smirnov, Dmitry & Huchzermeier, Arnd, 2020. "Analytics for labor planning in systems with load-dependent service times," European Journal of Operational Research, Elsevier, vol. 287(2), pages 668-681.
    10. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.
    11. 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.
    12. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    13. J. G. Dai & Pengyi Shi, 2017. "A Two-Time-Scale Approach to Time-Varying Queues in Hospital Inpatient Flow Management," Operations Research, INFORMS, vol. 65(2), pages 514-536, April.
    14. Heemskerk, M. & Mandjes, M. & Mathijsen, B., 2022. "Staffing for many-server systems facing non-standard arrival processes," European Journal of Operational Research, Elsevier, vol. 296(3), pages 900-913.
    15. Achal Bassamboo & Ramandeep S. Randhawa & Assaf Zeevi, 2010. "Capacity Sizing Under Parameter Uncertainty: Safety Staffing Principles Revisited," Management Science, INFORMS, vol. 56(10), pages 1668-1686, October.
    16. Ward Whitt, 2007. "What you should know about queueing models to set staffing requirements in service systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 476-484, August.
    17. Xi Chen & Dave Worthington, 2017. "Staffing of time-varying queues using a geometric discrete time modelling approach," Annals of Operations Research, Springer, vol. 252(1), pages 63-84, May.
    18. Dietz, Dennis C., 2011. "Practical scheduling for call center operations," Omega, Elsevier, vol. 39(5), pages 550-557, October.
    19. Abhishek, & Legros, Benjamin & Fransoo, Jan C., 2021. "Performance evaluation of stochastic systems with dedicated delivery bays and general on-street parking," Other publications TiSEM 09ed9572-d59c-4f28-a9c4-b, Tilburg University, School of Economics and Management.
    20. Kraig Delana & Nicos Savva & Tolga Tezcan, 2021. "Proactive Customer Service: Operational Benefits and Economic Frictions," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 70-87, 1-2.

    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:oropre:v:68:y:2020:i:2:p:327-347. 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.