IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v66y2020i8p3480-3500.html
   My bibliography  Save this article

Appointment Scheduling Under Time-Dependent Patient No-Show Behavior

Author

Listed:
  • Qingxia Kong

    (Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands)

  • Shan Li

    (Zicklin School of Business, Baruch College, City University of New York, New York, New York 10010)

  • Nan Liu

    (Carroll School of Management, Boston College, Chestnut Hill, Massachusetts 02467)

  • Chung-Piaw Teo

    (NUS Business School and Institute of Operations Research and Analytics, National University of Singapore, Singapore 119245)

  • Zhenzhen Yan

    (School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371)

Abstract

This paper studies how to schedule medical appointments with time-dependent patient no-show behavior and random service times. The problem is motivated by our studies of independent datasets from countries in two continents that unanimously identify a significant time-of-day effect on patient show-up probabilities. We deploy a distributionally robust model, which minimizes the worst-case total expected costs of patient waiting and service provider’s idling and overtime, by optimizing the scheduled arrival times of patients. This model is challenging because evaluating the total cost for a given schedule involves a linear program with uncertainties present in both the objective function and the right-hand side of the constraints. In addition, the ambiguity set considered contains discrete uncertainties and complementary functional relationships among these uncertainties (namely, patient no-shows and service durations). We show that when patient no-shows are exogenous (i.e., time-independent), the problem can be reformulated as a copositive program and then be approximated by semidefinite programs. When patient no-shows are endogenous on time (and hence on the schedule), the problem becomes a bilinear copositive program. We construct a set of dual prices to guide the search for a good schedule and use the technique iteratively to obtain a near-optimal solution. Our computational studies reveal a significant reduction in total expected cost by taking into account the time-of-day variation in patient show-up probabilities as opposed to ignoring it.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:ormnsc:v:66:y:2020:i:8:p:3480-3500
    DOI: 10.1287/mnsc.2019.3366
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/mnsc.2019.3366
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2019.3366?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. 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.
    2. Robin Vujanic & Paul Goulart & Manfred Morari, 2016. "Robust Optimization of Schedules Affected by Uncertain Events," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 1033-1054, December.
    3. Karthik Natarajan & Chung Piaw Teo & Zhichao Zheng, 2011. "Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation," Operations Research, INFORMS, vol. 59(3), pages 713-728, June.
    4. Refael Hassin & Sharon Mendel, 2008. "Scheduling Arrivals to Queues: A Single-Server Model with No-Shows," Management Science, INFORMS, vol. 54(3), pages 565-572, March.
    5. Viswanath, Kannan & Peeta, Srinivas & Salman, Sibel F., 2004. "Investing in the Links of a Stochastic Network to Minimize Expected Shortest Path. Length," Purdue University Economics Working Papers 1167, Purdue University, Department of Economics.
    6. Guido Kaandorp & Ger Koole, 2007. "Optimal outpatient appointment scheduling," Health Care Management Science, Springer, vol. 10(3), pages 217-229, September.
    7. Lawrence W. Robinson & Rachel R. Chen, 2010. "A Comparison of Traditional and Open-Access Policies for Appointment Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 330-346, June.
    8. Jianzhe Luo & Vidyadhar G. Kulkarni & Serhan Ziya, 2012. "Appointment Scheduling Under Patient No-Shows and Service Interruptions," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 670-684, October.
    9. Peter Dickinson & Luuk Gijben, 2014. "On the computational complexity of membership problems for the completely positive cone and its dual," Computational Optimization and Applications, Springer, vol. 57(2), pages 403-415, March.
    10. 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.
    11. Sarah Yini Gao & David Simchi-Levi & Chung-Piaw Teo & Zhenzhen Yan, 2019. "Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited," Operations Research, INFORMS, vol. 67(3), pages 831-852, May.
    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. Aditya Shetty & Harry Groenevelt & Vera Tilson, 2023. "Intraday dynamic rescheduling under patient no-shows," Health Care Management Science, Springer, vol. 26(3), pages 583-598, September.
    2. 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.
    3. Nossack, Jenny, 2022. "Therapy scheduling and therapy planning at hospitals," Omega, Elsevier, vol. 109(C).
    4. 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.
    5. 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.
    6. Carolin Bauerhenne & Rainer Kolisch & Andreas S. Schulz, 2024. "Robust Appointment Scheduling with Waiting Time Guarantees," Papers 2402.12561, arXiv.org.
    7. Yuan Gao & Qian Zhang & Chun Kit Lau & Bhagwat Ram, 2022. "Robust Appointment Scheduling in Healthcare," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
    8. Ming Zhao & Nickolas Freeman & Kai Pan, 2023. "Robust Sourcing Under Multilevel Supply Risks: Analysis of Random Yield and Capacity," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 178-195, January.
    9. Ariel Neufeld & Matthew Ng Cheng En & Ying Zhang, 2024. "Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems," Papers 2403.09532, arXiv.org.
    10. Namakshenas, Mohammad & Mazdeh, Mohammad Mahdavi & Braaksma, Aleida & Heydari, Mehdi, 2023. "Appointment scheduling for medical diagnostic centers considering time-sensitive pharmaceuticals: A dynamic robust optimization approach," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1018-1031.
    11. Reihaneh, Mohammad & Ansari, Sina & Farhadi, Farbod, 2023. "Patient appointment scheduling at hemodialysis centers: An exact branch and price approach," European Journal of Operational Research, Elsevier, vol. 309(1), pages 35-52.
    12. Farbod Farhadi & Sina Ansari & Francisco Jara-Moroni, 2023. "Optimization models for patient and technician scheduling in hemodialysis centers," Health Care Management Science, Springer, vol. 26(3), pages 558-582, September.

    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. 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.
    2. Shan Wang & Nan Liu & Guohua Wan, 2020. "Managing Appointment-Based Services in the Presence of Walk-in Customers," Management Science, INFORMS, vol. 66(2), pages 667-686, February.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Shenghai Zhou & Yichuan Ding & Woonghee Tim Huh & Guohua Wan, 2021. "Constant Job‐Allowance Policies for Appointment Scheduling: Performance Bounds and Numerical Analysis," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2211-2231, July.
    8. Dongyang Wang & Kumar Muthuraman & Douglas Morrice, 2019. "Coordinated Patient Appointment Scheduling for a Multistation Healthcare Network," Operations Research, INFORMS, vol. 67(3), pages 599-618, May.
    9. Kuiper, Alex & de Mast, Jeroen & Mandjes, Michel, 2021. "The problem of appointment scheduling in outpatient clinics: A multiple case study of clinical practice," Omega, Elsevier, vol. 98(C).
    10. Zhou, Shenghai & Li, Debiao & Yin, Yong, 2021. "Coordinated appointment scheduling with multiple providers and patient-and-physician matching cost in specialty care," Omega, Elsevier, vol. 101(C).
    11. Ruijie Zhang & Xiaohua Han & Rowan Wang & Jianghua Zhang & Yinghao Zhang, 2023. "Please don't make me wait! Influence of customers' waiting preference and no‐show behavior on appointment systems," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1597-1616, June.
    12. Van-Anh Truong, 2015. "Optimal Advance Scheduling," Management Science, INFORMS, vol. 61(7), pages 1584-1597, July.
    13. Badenbroek, Riley & de Klerk, Etienne, 2022. "An analytic center cutting plane method to determine complete positivity of a matrix," Other publications TiSEM 088da653-b943-4ed0-9720-6, Tilburg University, School of Economics and Management.
    14. Pan, Xingwei & Geng, Na & Xie, Xiaolan, 2021. "Appointment scheduling and real-time sequencing strategies for patient unpunctuality," European Journal of Operational Research, Elsevier, vol. 295(1), pages 246-260.
    15. Wen-Ya Wang & Diwakar Gupta, 2011. "Adaptive Appointment Systems with Patient Preferences," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 373-389, July.
    16. Katsumi Morikawa & Katsuhiko Takahashi & Daisuke Hirotani, 2018. "Performance evaluation of candidate appointment schedules using clearing functions," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 509-518, March.
    17. Li Luo & Ying Zhou & Bernard T. Han & Jialing Li, 2019. "An optimization model to determine appointment scheduling window for an outpatient clinic with patient no-shows," Health Care Management Science, Springer, vol. 22(1), pages 68-84, March.
    18. Kuiper, Alex & Mandjes, Michel, 2015. "Appointment scheduling in tandem-type service systems," Omega, Elsevier, vol. 57(PB), pages 145-156.
    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. Riley Badenbroek & Etienne de Klerk, 2022. "An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1115-1125, March.

    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:ormnsc:v:66:y:2020:i:8:p:3480-3500. 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.