IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i5p1201-1224.html
   My bibliography  Save this article

Appointment Scheduling with Delay Tolerance Heterogeneity

Author

Listed:
  • Shuming Wang

    (School of Economics and Management, University of Chinese Academy of Sciences, Beijing 100190, China; MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation, University of Chinese Academy of Sciences, Beijing 100190, China)

  • Jun Li

    (Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576, Singapore)

  • Marcus Ang

    (Lee Kong Chian School of Business, Singapore Management University, Singapore 178899, Singapore)

  • Tsan Sheng Ng

    (Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576, Singapore)

Abstract

In this study, we investigate an appointment sequencing and scheduling problem with heterogeneous user delay tolerances under service time uncertainty. We aim to capture the delay tolerance effect with heterogeneity, in an operationally effective and computationally tractable fashion, for the appointment scheduling problem. To this end, we first propose a Tolerance-Aware Delay (TAD) index that incorporates explicitly the user tolerance information in delay evaluation. We show that the TAD index enjoys decision-theoretical rationale in terms of Tolerance sensitivity , monotonicity , and convexity and positive homogeneity , which enables it to incorporate the frequency and intensity of delays over the tolerance in a coherent manner. Specifically, the convexity of TAD index ensures a tractable modeling of the collective delay dissatisfaction in the appointment scheduling problem. Using the TAD index, we then develop an appointment model with known empirical service time distribution that minimizes the overall tolerance-aware delays of all users. We analyze the impact of delay tolerance on the sequence and schedule decisions and show that the resultant TAD appointment model can be reformulated as a mixed-integer linear program (MILP). Furthermore, we extend the TAD appointment model by considering service time ambiguity. In particular, we encode into the TAD index a moment ambiguity set and a Wasserstein ambiguity set, respectively. The former captures effectively the correlation among service times across positions and user types, whereas the latter captures directly the service time data information. We show that both of the resultant TAD models under ambiguity can be reformulated as polynomial-sized, mixed-integer conic programs (MICPs). Finally, we compare our TAD models with some existing counterpart approaches and the current practice using synthetic data and a case of real hospital data, respectively. Our results demonstrate the effectiveness of the TAD appointment models in capturing the user delay tolerance with heterogeneity and mitigating the worst-case delays.

Suggested Citation

  • Shuming Wang & Jun Li & Marcus Ang & Tsan Sheng Ng, 2024. "Appointment Scheduling with Delay Tolerance Heterogeneity," INFORMS Journal on Computing, INFORMS, vol. 36(5), pages 1201-1224, September.
  • Handle: RePEc:inm:orijoc:v:36:y:2024:i:5:p:1201-1224
    DOI: 10.1287/ijoc.2023.0025
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2023.0025
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2023.0025?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. Jin Qi, 2017. "Mitigating Delays and Unfairness in Appointment Systems," Management Science, INFORMS, vol. 63(2), pages 566-583, February.
    2. Alex Kuiper & Robert H. Lee, 2022. "Appointment Scheduling for Multiple Servers," Management Science, INFORMS, vol. 68(10), pages 7422-7440, October.
    3. Qingxia Kong & Chung-Yee Lee & Chung-Piaw Teo & Zhichao Zheng, 2013. "Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones," Operations Research, INFORMS, vol. 61(3), pages 711-726, June.
    4. Karmel S. Shehadeh & Amy E. M. Cohn & Ruiwei Jiang, 2021. "Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(1), pages 89-111, February.
    5. Marynissen, Joren & Demeulemeester, Erik, 2019. "Literature review on multi-appointment scheduling problems in hospitals," European Journal of Operational Research, Elsevier, vol. 272(2), pages 407-419.
    6. Lawrence W. Robinson & Rachel R. Chen, 2011. "Estimating the Implied Value of the Customer's Waiting Time," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 53-57, February.
    7. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    8. Christos Zacharias & Michael Pinedo, 2017. "Managing Customer Arrivals in Service Systems with Multiple Identical Servers," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 639-656, October.
    9. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    10. Aharon Ben‐Tal & Marc Teboulle, 2007. "An Old‐New Concept Of Convex Risk Measures: The Optimized Certainty Equivalent," Mathematical Finance, Wiley Blackwell, vol. 17(3), pages 449-476, July.
    11. Wu, Xianyi & Zhou, Xian, 2008. "Stochastic scheduling to minimize expected maximum lateness," European Journal of Operational Research, Elsevier, vol. 190(1), pages 103-115, October.
    12. Ahmadi-Javid, Amir & Jalali, Zahra & Klassen, Kenneth J, 2017. "Outpatient appointment systems in healthcare: A review of optimization studies," European Journal of Operational Research, Elsevier, vol. 258(1), pages 3-34.
    13. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    14. Qingxia Kong & Shan Li & Nan Liu & Chung-Piaw Teo & Zhenzhen Yan, 2020. "Appointment Scheduling Under Time-Dependent Patient No-Show Behavior," Management Science, INFORMS, vol. 66(8), pages 3480-3500, August.
    15. Silviya Nikolova & Mark Harrison & Matt Sutton, 2016. "The Impact of Waiting Time on Health Gains from Surgery: Evidence from a National Patient‐reported Outcome Dataset," Health Economics, John Wiley & Sons, Ltd., vol. 25(8), pages 955-968, August.
    16. Alexander Vinel & Pavlo A. Krokhmal, 2017. "Certainty equivalent measures of risk," Annals of Operations Research, Springer, vol. 249(1), pages 75-95, February.
    17. Philippe Artzner & Freddy Delbaen & Jean‐Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228, July.
    18. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    19. Tito Homem-de-Mello & Qingxia Kong & Rodrigo Godoy-Barba, 2022. "A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2845-2865, September.
    20. S. Ayca Erdogan & Brian Denton, 2013. "Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 116-132, February.
    21. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    22. Samorani, Michele & LaGanga, Linda R., 2015. "Outpatient appointment scheduling given individual day-dependent no-show predictions," European Journal of Operational Research, Elsevier, vol. 240(1), pages 245-257.
    23. Samuel Drapeau & Michael Kupper, 2013. "Risk Preferences and Their Robust Representation," Mathematics of Operations Research, INFORMS, vol. 38(1), pages 28-62, February.
    24. Wu, Xueqi & Zhou, Shenghai, 2022. "Sequencing and scheduling appointments on multiple servers with stochastic service durations and customer arrivals," Omega, Elsevier, vol. 106(C).
    25. Nan Liu & Stacey R. Finkelstein & Margaret E. Kruk & David Rosenthal, 2018. "When Waiting to See a Doctor Is Less Irritating: Understanding Patient Preferences and Choice Behavior in Appointment Scheduling," Management Science, INFORMS, vol. 64(5), pages 1975-1996, May.
    26. Miao Bai & Robert H. Storer & Gregory L. Tonkay, 2022. "Surgery Sequencing Coordination with Recovery Resource Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1207-1223, March.
    27. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    Full references (including those not matched with items on IDEAS)

    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. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    2. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    3. Tito Homem-de-Mello & Qingxia Kong & Rodrigo Godoy-Barba, 2022. "A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2845-2865, September.
    4. Esmaeil Keyvanshokooh & Pooyan Kazemian & Mohammad Fattahi & Mark P. Van Oyen, 2022. "Coordinated and Priority‐Based Surgical Care: An Integrated Distributionally Robust Stochastic Optimization Approach," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1510-1535, April.
    5. Shehadeh, Karmel S. & Cohn, Amy E.M. & Jiang, Ruiwei, 2020. "A distributionally robust optimization approach for outpatient colonoscopy scheduling," European Journal of Operational Research, Elsevier, vol. 283(2), pages 549-561.
    6. Arlen Dean & Amirhossein Meisami & Henry Lam & Mark P. Van Oyen & Christopher Stromblad & Nick Kastango, 2022. "Quantile regression forests for individualized surgery scheduling," Health Care Management Science, Springer, vol. 25(4), pages 682-709, December.
    7. Carolin Bauerhenne & Rainer Kolisch & Andreas S. Schulz, 2024. "Robust Appointment Scheduling with Waiting Time Guarantees," Papers 2402.12561, arXiv.org.
    8. Wu, Xueqi & Zhou, Shenghai, 2022. "Sequencing and scheduling appointments on multiple servers with stochastic service durations and customer arrivals," Omega, Elsevier, vol. 106(C).
    9. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    10. Alex Kuiper & Robert H. Lee, 2022. "Appointment Scheduling for Multiple Servers," Management Science, INFORMS, vol. 68(10), pages 7422-7440, October.
    11. Oualid Jouini & Saif Benjaafar & Bingnan Lu & Siqiao Li & Benjamin Legros, 2022. "Appointment-driven queueing systems with non-punctual customers," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 1-56, June.
    12. Avishai Mandelbaum & Petar Momčilović & Nikolaos Trichakis & Sarah Kadish & Ryan Leib & Craig A. Bunnell, 2020. "Data-Driven Appointment-Scheduling Under Uncertainty: The Case of an Infusion Unit in a Cancer Center," Management Science, INFORMS, vol. 66(1), pages 243-270, January.
    13. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    14. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
    15. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    16. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    17. Postek, K.S. & den Hertog, D. & Melenberg, B., 2015. "Computationally Tractable Counterparts of Distributionally Robust Constraints on Risk Measures (revision of CentER DP 2014-031)," Discussion Paper 2015-047, Tilburg University, Center for Economic Research.
    18. Kazim Topuz & Timothy L. Urban & Robert A. Russell & Mehmet B. Yildirim, 2024. "Decision support system for appointment scheduling and overbooking under patient no-show behavior," Annals of Operations Research, Springer, vol. 342(1), pages 845-873, November.
    19. Tsang, Man Yiu & Shehadeh, Karmel S., 2023. "Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times," European Journal of Operational Research, Elsevier, vol. 307(1), pages 48-63.
    20. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.

    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:orijoc:v:36:y:2024:i:5:p:1201-1224. 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.