IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v27y2018i1p58-79.html
   My bibliography  Save this article

Dynamic Patient Scheduling for Multi†Appointment Health Care Programs

Author

Listed:
  • Adam Diamant
  • Joseph Milner
  • Fayez Quereshy

Abstract

We investigate the scheduling practices of a multidisciplinary, multistage, outpatient health care program. Patients undergo a series of assessments before being eligible for elective surgery. Such systems often suffer from high rates of attrition and appointment no†shows leading to capacity underutilization and treatment delays. We propose a new scheduling model where the clinic assigns patients to an appointment day but postpones the decision of which assessments patients undergo pending the observation of who arrives. In doing so, the clinic gains flexibility to improve system performance. We formulate the scheduling problem as a Markov decision process and use approximate dynamic programming to solve it. We apply our approach to a dataset collected from a bariatric surgery program at a large tertiary hospital in Toronto, Canada. We examine the quality of our solutions via structural results and compare them with heuristic scheduling practices using a discrete†event simulation. By allowing multiple assessments, delaying their scheduling, and by optimizing over an appointment book, we show significant improvements in patient throughput, clinic profit, use of overtime, and staff utilization.

Suggested Citation

  • Adam Diamant & Joseph Milner & Fayez Quereshy, 2018. "Dynamic Patient Scheduling for Multi†Appointment Health Care Programs," Production and Operations Management, Production and Operations Management Society, vol. 27(1), pages 58-79, January.
  • Handle: RePEc:bla:popmgt:v:27:y:2018:i:1:p:58-79
    DOI: 10.1111/poms.12783
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.12783
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.12783?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
    ---><---

    Citations

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


    Cited by:

    1. Thomas W.M. Vossen & Fan You & Dan Zhang, 2022. "Finite‐horizon approximate linear programs for capacity allocation over a rolling horizon," Production and Operations Management, Production and Operations Management Society, vol. 31(5), pages 2127-2142, May.
    2. Liping Zhou & Na Geng & Zhibin Jiang & Shan Jiang, 2022. "Integrated Multiresource Capacity Planning and Multitype Patient Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 129-149, January.
    3. Laumer, Simon & Barz, Christiane, 2023. "Reductions of non-separable approximate linear programs for network revenue management," European Journal of Operational Research, Elsevier, vol. 309(1), pages 252-270.
    4. Siyun Yu & Vidyadhar G. Kulkarni & Vinayak Deshpande, 2020. "Appointment Scheduling for a Health Care Facility with Series Patients," Production and Operations Management, Production and Operations Management Society, vol. 29(2), pages 388-409, February.
    5. Ni Huang & Zhijun Yan & Haonan Yin, 2021. "Effects of Online–Offline Service Integration on e‐Healthcare Providers: A Quasi‐Natural Experiment," Production and Operations Management, Production and Operations Management Society, vol. 30(8), pages 2359-2378, August.
    6. Adam Diamant, 2021. "Dynamic multistage scheduling for patient-centered care plans," Health Care Management Science, Springer, vol. 24(4), pages 827-844, December.
    7. Meersman, Tine & Maenhout, Broos & Van Herck, Koen, 2023. "A nested Benders decomposition-based algorithm to solve the three-stage stochastic optimisation problem modeling population-based breast cancer screening," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1273-1293.
    8. Shao, Kaining & Fan, Wenjuan & Lan, Shaowen & Kong, Min & Yang, Shanlin, 2023. "A column generation-based heuristic for brachytherapy patient scheduling with multiple treatment sessions considering radioactive source decay and time constraints," Omega, Elsevier, vol. 118(C).
    9. Martin Bichler & Soeren Merting, 2021. "Randomized Scheduling Mechanisms: Assigning Course Seats in a Fair and Efficient Way," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3540-3559, October.
    10. Xiang Li & Haoyue Fan & Jiaming Liu & Qifeng Xun, 2022. "Staff scheduling in blood collection problems," Annals of Operations Research, Springer, vol. 316(1), pages 365-400, September.
    11. Zheng Wang & Jiuh‐Biing Sheu & Chung‐Piaw Teo & Guiqin Xue, 2022. "Robot Scheduling for Mobile‐Rack Warehouses: Human–Robot Coordinated Order Picking Systems," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 98-116, January.
    12. 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.
    13. Gang Du & Xinyue Li & Hui Hu & Xiaoling Ouyang, 2018. "Optimizing Daily Service Scheduling for Medical Diagnostic Equipment Considering Patient Satisfaction and Hospital Revenue," Sustainability, MDPI, vol. 10(9), pages 1-23, September.
    14. 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.
    15. Jesús Isaac Vázquez-Serrano & Rodrigo E. Peimbert-García & Leopoldo Eduardo Cárdenas-Barrón, 2021. "Discrete-Event Simulation Modeling in Healthcare: A Comprehensive Review," IJERPH, MDPI, vol. 18(22), pages 1-20, November.

    More about this item

    Statistics

    Access and download statistics

    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:bla:popmgt:v:27:y:2018:i:1:p:58-79. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.