IDEAS home Printed from https://ideas.repec.org/a/kap/hcarem/v24y2021i1d10.1007_s10729-020-09519-z.html
   My bibliography  Save this article

Scheduling patient appointment in an infusion center: a mixed integer robust optimization approach

Author

Listed:
  • Mona Issabakhsh

    (University of Miami)

  • Seokgi Lee

    (University of Miami)

  • Hyojung Kang

    (University of Illinois at Urbana-Champaign)

Abstract

Infusion centers are experiencing greater demand, resulting in long patient wait times. The duration of chemotherapy treatment sessions often varies, and this uncertainty also contributes to longer patient wait times and to staff overtime, if not managed properly. The impact of such long wait times can be significant for cancer patients due to their physical and emotional vulnerability. In this paper, a mixed integer programming infusion appointment scheduling (IAS) mathematical model is developed based on patient appointment data, obtained from a cancer center of an academic hospital in Central Virginia. This model minimizes the weighted sum of the total wait times of patients, the makespan and the number of beds used through the planning horizon. A mixed integer programming robust slack allocation (RSA) mathematical model is designed to find the optimal patient appointment schedules, considering the fact that infusion time of patients may take longer than expected. Since the models can only handle a small number of patients, a robust scheduling heuristic (RSH) is developed based on the adaptive large neighborhood search (ALNS) to find patient appointments of real size infusion centers. Computational experiments based on real data show the effectiveness of the scheduling models compared to the original scheduling system of the infusion center. Also, both robust approaches (RSA and RSH) are able to find more reliable schedules than their deterministic counterparts when infusion time of patients takes longer than the scheduled infusion time.

Suggested Citation

  • Mona Issabakhsh & Seokgi Lee & Hyojung Kang, 2021. "Scheduling patient appointment in an infusion center: a mixed integer robust optimization approach," Health Care Management Science, Springer, vol. 24(1), pages 117-139, March.
  • Handle: RePEc:kap:hcarem:v:24:y:2021:i:1:d:10.1007_s10729-020-09519-z
    DOI: 10.1007/s10729-020-09519-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10729-020-09519-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10729-020-09519-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bohui Liang & Ayten Turkcan & Mehmet Erkan Ceyhan & Keith Stuart, 2015. "Improvement of chemotherapy patient flow and scheduling in an outpatient oncology clinic," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7177-7190, December.
    2. Min, Daiki & Yih, Yuehwern, 2010. "Scheduling elective surgery under uncertainty and downstream capacity constraints," European Journal of Operational Research, Elsevier, vol. 206(3), pages 642-652, November.
    3. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    4. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    5. Michelle Alvarado & Lewis Ntaimo, 2018. "Chemotherapy appointment scheduling under uncertainty using mean-risk stochastic integer programming," Health Care Management Science, Springer, vol. 21(1), pages 87-104, March.
    6. Shoshana Hahn-Goldberg & Michael Carter & J. Beck & Maureen Trudeau & Philomena Sousa & Kathy Beattie, 2014. "Dynamic optimization of chemotherapy outpatient scheduling with uncertainty," Health Care Management Science, Springer, vol. 17(4), pages 379-392, December.
    7. Brian Denton & James Viapiano & Andrea Vogl, 2007. "Optimization of surgery sequencing and scheduling decisions under uncertainty," Health Care Management Science, Springer, vol. 10(1), pages 13-24, February.
    8. Hesaraki, Alireza F. & Dellaert, Nico P. & de Kok, Ton, 2019. "Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan," European Journal of Operational Research, Elsevier, vol. 275(1), pages 304-318.
    9. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    10. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    11. N Celik & OM Araz & M Bastani & J P Saenz, 2017. "An agent-based model of social networks for evaluating asthma control interventions on reducing the emergency department visits," Journal of Simulation, Taylor & Francis Journals, vol. 11(2), pages 87-102, 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. Majed Hadid & Adel Elomri & Regina Padmanabhan & Laoucine Kerbache & Oualid Jouini & Abdelfatteh El Omri & Amir Nounou & Anas Hamad, 2022. "Clustering and Stochastic Simulation Optimization for Outpatient Chemotherapy Appointment Planning and Scheduling," IJERPH, MDPI, vol. 19(23), pages 1-34, November.
    2. Carolin Bauerhenne & Rainer Kolisch & Andreas S. Schulz, 2024. "Robust Appointment Scheduling with Waiting Time Guarantees," Papers 2402.12561, arXiv.org.
    3. Yuan Gao & Qian Zhang & Chun Kit Lau & Bhagwat Ram, 2022. "Robust Appointment Scheduling in Healthcare," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
    4. Golmohammadi, Davood & Zhao, Lingyu & Dreyfus, David, 2023. "Using machine learning techniques to reduce uncertainty for outpatient appointment scheduling practices in outpatient clinics," Omega, Elsevier, vol. 120(C).

    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. Zhao, Lei & Bi, Xinhua & Li, Gendao & Dong, Zhaohui & Xiao, Ni & Zhao, Anni, 2022. "Robust traveling salesman problem with multiple drones: Parcel delivery under uncertain navigation environments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    2. Majed Hadid & Adel Elomri & Regina Padmanabhan & Laoucine Kerbache & Oualid Jouini & Abdelfatteh El Omri & Amir Nounou & Anas Hamad, 2022. "Clustering and Stochastic Simulation Optimization for Outpatient Chemotherapy Appointment Planning and Scheduling," IJERPH, MDPI, vol. 19(23), pages 1-34, November.
    3. Nur Banu Demir & Serhat Gul & Melih Çelik, 2021. "A stochastic programming approach for chemotherapy appointment scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(1), pages 112-133, February.
    4. Hadid, Majed & Elomri, Adel & Mekkawy, Tarek El & Jouini, Oualid & Kerbache, Laoucine & Hamad, Anas, 2022. "Operations management of outpatient chemotherapy process: An optimization-oriented comprehensive review," Operations Research Perspectives, Elsevier, vol. 9(C).
    5. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    6. Bernardetta Addis & Giuliana Carello & Andrea Grosso & Elena Tànfani, 2016. "Operating room scheduling and rescheduling: a rolling horizon approach," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 206-232, June.
    7. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    8. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    9. Wang, Yu & Zhang, Yu & Tang, Jiafu, 2019. "A distributionally robust optimization approach for surgery block allocation," European Journal of Operational Research, Elsevier, vol. 273(2), pages 740-753.
    10. Wang, Yu & Zhang, Yu & Tang, Jiafu, 2024. "Wasserstein distributionally robust surgery scheduling with elective and emergency patients," European Journal of Operational Research, Elsevier, vol. 314(2), pages 509-522.
    11. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    12. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    13. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The impact of depot location, fleet composition and routing on emissions in city logistics," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 81-102.
    14. Agnetis, Alessandro & Bianciardi, Caterina & Iasparra, Nicola, 2019. "Integrating lean thinking and mathematical optimization: A case study in appointment scheduling of hematological treatments," Operations Research Perspectives, Elsevier, vol. 6(C).
    15. 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.
    16. Marques, Inês & Captivo, M. Eugénia, 2017. "Different stakeholders’ perspectives for a surgical case assignment problem: Deterministic and robust approaches," European Journal of Operational Research, Elsevier, vol. 261(1), pages 260-278.
    17. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2017. "A hybrid solution approach for the 3L-VRP with simultaneous delivery and pickups," FEMM Working Papers 170005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    18. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 248(1), pages 33-51.
    19. Zhang, Jianghua & Zhao, Yingxue & Xue, Weili & Li, Jin, 2015. "Vehicle routing problem with fuel consumption and carbon emission," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 234-242.
    20. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2014. "The fleet size and mix pollution-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 239-254.

    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:kap:hcarem:v:24:y:2021:i:1:d:10.1007_s10729-020-09519-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.