IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v280y2020i1p254-265.html
   My bibliography  Save this article

Dynamic multi-priority, multi-class patient scheduling with stochastic service times

Author

Listed:
  • Sauré, Antoine
  • Begen, Mehmet A.
  • Patrick, Jonathan

Abstract

Efficient patient scheduling has significant operational, clinical and economical benefits on health care systems by not only increasing the timely access of patients to care but also reducing costs. However, patient scheduling is complex due to, among other aspects, the existence of multiple priority levels, the presence of multiple service requirements, and its stochastic nature. Patient appointment (allocation) scheduling refers to the assignment of specific appointment start times to a set of patients scheduled for a particular day while advance patient scheduling refers to the assignment of future appointment days to patients. These two problems have generally been addressed separately despite each being highly dependent on the form of the other. This paper develops a framework that incorporates stochastic service times into the advance scheduling problem as a first step towards bridging these two problems. In this way, we not only take into account the waiting time until the day of service but also the idle time/overtime of medical resources on the day of service. We first extend the current literature by providing theoretical and numerical results for the case with multi-class, multi-priority patients and deterministic service times. We then adapt the model to incorporate stochastic service times and perform a comprehensive numerical analysis on a number of scenarios, including a practical application. Results suggest that the advance scheduling policies based on deterministic service times cannot be easily improved upon by incorporating stochastic service times, a finding that has important implications for practice and future research on the combined problem.

Suggested Citation

  • Sauré, Antoine & Begen, Mehmet A. & Patrick, Jonathan, 2020. "Dynamic multi-priority, multi-class patient scheduling with stochastic service times," European Journal of Operational Research, Elsevier, vol. 280(1), pages 254-265.
  • Handle: RePEc:eee:ejores:v:280:y:2020:i:1:p:254-265
    DOI: 10.1016/j.ejor.2019.06.040
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719305338
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2019.06.040?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.

    Citations

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


    Cited by:

    1. Marquinez, José Tomás & Sauré, Antoine & Cataldo, Alejandro & Ferrer, Juan-Carlos, 2021. "Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network," European Journal of Operational Research, Elsevier, vol. 295(1), pages 306-320.
    2. Azar, Macarena & Carrasco, Rodrigo A. & Mondschein, Susana, 2022. "Dealing with uncertain surgery times in operating room scheduling," European Journal of Operational Research, Elsevier, vol. 299(1), pages 377-394.
    3. Naderi, Bahman & Begen, Mehmet A. & Zaric, Gregory S. & Roshanaei, Vahid, 2023. "A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty," Omega, Elsevier, vol. 116(C).
    4. Tu San Pham & Antoine Legrain & Patrick De Causmaecker & Louis-Martin Rousseau, 2023. "A Prediction-Based Approach for Online Dynamic Appointment Scheduling: A Case Study in Radiotherapy Treatment," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 844-868, July.
    5. Fathi, Mahdi & Khakifirooz, Marzieh & Diabat, Ali & Chen, Huangen, 2021. "An integrated queuing-stochastic optimization hybrid Genetic Algorithm for a location-inventory supply chain network," International Journal of Production Economics, Elsevier, vol. 237(C).
    6. Cheng Wang & Runhua Wu & Lili Deng & Yong Chen & Yingde Li & Yuehua Wan, 2020. "A Bibliometric Analysis on No-Show Research: Status, Hotspots, Trends and Outlook," Sustainability, MDPI, vol. 12(10), pages 1-17, May.
    7. Gökalp, E. & Gülpınar, N. & Doan, X.V., 2023. "Dynamic surgery management under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(2), pages 832-844.

    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:eee:ejores:v:280:y:2020:i:1:p:254-265. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.