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

Dynamic multi-appointment patient scheduling for radiation therapy

Author

Listed:
  • Sauré, Antoine
  • Patrick, Jonathan
  • Tyldesley, Scott
  • Puterman, Martin L.

Abstract

Seeking to reduce the potential impact of delays on radiation therapy cancer patients such as psychological distress, deterioration in quality of life and decreased cancer control and survival, and motivated by inefficiencies in the use of expensive resources, we undertook a study of scheduling practices at the British Columbia Cancer Agency (BCCA). As a result, we formulated and solved a discounted infinite-horizon Markov decision process for scheduling cancer treatments in radiation therapy units. The main purpose of this model is to identify good policies for allocating available treatment capacity to incoming demand, while reducing wait times in a cost-effective manner. We use an affine architecture to approximate the value function in our formulation and solve an equivalent linear programming model through column generation to obtain an approximate optimal policy for this problem. The benefits from the proposed method are evaluated by simulating its performance for a practical example based on data provided by the BCCA.

Suggested Citation

  • Sauré, Antoine & Patrick, Jonathan & Tyldesley, Scott & Puterman, Martin L., 2012. "Dynamic multi-appointment patient scheduling for radiation therapy," European Journal of Operational Research, Elsevier, vol. 223(2), pages 573-584.
    • Handle: RePEc:eee:ejores:v:223:y:2012:i:2:p:573-584
    DOI: 10.1016/j.ejor.2012.06.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171200522X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.06.046?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. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    2. Kim, Minsun & Ghate, Archis & Phillips, Mark H., 2012. "A stochastic control formalism for dynamic biologically conformal radiation therapy," European Journal of Operational Research, Elsevier, vol. 219(3), pages 541-556.
    3. Lamiri, Mehdi & Xie, Xiaolan & Dolgui, Alexandre & Grimaud, Frederic, 2008. "A stochastic model for operating room planning with elective and emergency demand for surgery," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1026-1037, March.
    4. Daniel Adelman & Diego Klabjan, 2012. "Computing Near-Optimal Policies in Generalized Joint Replenishment," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 148-164, February.
    5. Yigal Gerchak & Diwakar Gupta & Mordechai Henig, 1996. "Reservation Planning for Elective Surgery Under Uncertain Demand for Emergency Surgery," Management Science, INFORMS, vol. 42(3), pages 321-334, March.
    6. Conforti, D. & Guerriero, F. & Guido, R., 2010. "Non-block scheduling with priority for radiotherapy treatments," European Journal of Operational Research, Elsevier, vol. 201(1), pages 289-296, February.
    7. Edward J. Rising & Robert Baron & Barry Averill, 1973. "A Systems Analysis of a University-Health-Service Outpatient Clinic," Operations Research, INFORMS, vol. 21(5), pages 1030-1047, October.
    8. Schütz, Hans-Jörg & Kolisch, Rainer, 2012. "Approximate dynamic programming for capacity allocation in the service industry," European Journal of Operational Research, Elsevier, vol. 218(1), pages 239-250.
    9. D. P. de Farias & B. Van Roy, 2003. "The Linear Programming Approach to Approximate Dynamic Programming," Operations Research, INFORMS, vol. 51(6), pages 850-865, December.
    10. Daniel Adelman & Adam J. Mersereau, 2008. "Relaxations of Weakly Coupled Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 56(3), pages 712-727, June.
    11. Misic, V.V. & Aleman, D.M. & Sharpe, M.B., 2010. "Neighborhood search approaches to non-coplanar beam orientation optimization for total marrow irradiation using IMRT," European Journal of Operational Research, Elsevier, vol. 205(3), pages 522-527, September.
    12. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    13. Lim, Gino J. & Cao, Wenhua, 2012. "A two-phase method for selecting IMRT treatment beam angles: Branch-and-Prune and local neighborhood search," European Journal of Operational Research, Elsevier, vol. 217(3), pages 609-618.
    14. Cardoen, Brecht & Demeulemeester, Erik & Beliën, Jeroen, 2010. "Operating room planning and scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 201(3), pages 921-932, March.
    15. Alexander Erdelyi & Huseyin Topaloglu, 2009. "Computing protection level policies for dynamic capacity allocation problems by using stochastic approximation methods," IISE Transactions, Taylor & Francis Journals, vol. 41(6), pages 498-510.
    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. 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.
    2. Antoine Sauré & Jonathan Patrick & Martin L. Puterman, 2015. "Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 579-595, August.
    3. T. Meersman & B. Maenhout, 2022. "Multi-objective optimisation for constructing cyclic appointment schedules for elective and urgent patients," Annals of Operations Research, Springer, vol. 312(2), pages 909-948, May.
    4. Astaraky, Davood & Patrick, Jonathan, 2015. "A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling," European Journal of Operational Research, Elsevier, vol. 245(1), pages 309-319.
    5. Yasin Gocgun, 2018. "Simulation-based approximate policy iteration for dynamic patient scheduling for radiation therapy," Health Care Management Science, Springer, vol. 21(3), pages 317-325, September.
    6. Shuwan Zhu & Wenjuan Fan & Shanlin Yang & Jun Pei & Panos M. Pardalos, 2019. "Operating room planning and surgical case scheduling: a review of literature," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 757-805, April.
    7. 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.
    8. Khaniyev, Taghi & Kayış, Enis & Güllü, Refik, 2020. "Next-day operating room scheduling with uncertain surgery durations: Exact analysis and heuristics," European Journal of Operational Research, Elsevier, vol. 286(1), pages 49-62.
    9. Gartner, Daniel & Kolisch, Rainer, 2014. "Scheduling the hospital-wide flow of elective patients," European Journal of Operational Research, Elsevier, vol. 233(3), pages 689-699.
    10. Jonathan Patrick & Martin L. Puterman & Maurice Queyranne, 2008. "Dynamic Multipriority Patient Scheduling for a Diagnostic Resource," Operations Research, INFORMS, vol. 56(6), pages 1507-1525, December.
    11. 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.
    12. Silva, Thiago A.O. & de Souza, Mauricio C., 2020. "Surgical scheduling under uncertainty by approximate dynamic programming," Omega, Elsevier, vol. 95(C).
    13. H. Romero & N. Dellaert & S. Geer & M. Frunt & M. Jansen-Vullers & G. Krekels, 2013. "Admission and capacity planning for the implementation of one-stop-shop in skin cancer treatment using simulation-based optimization," Health Care Management Science, Springer, vol. 16(1), pages 75-86, March.
    14. Yao Xiao & Reena Yoogalingam, 2021. "Reserved capacity policies for operating room scheduling," Operations Management Research, Springer, vol. 14(1), pages 107-122, June.
    15. Wang, Yu & Tang, Jiafu & Fung, Richard Y.K., 2014. "A column-generation-based heuristic algorithm for solving operating theater planning problem under stochastic demand and surgery cancellation risk," International Journal of Production Economics, Elsevier, vol. 158(C), pages 28-36.
    16. Francesca Guerriero & Rosita Guido, 2011. "Operational research in the management of the operating theatre: a survey," Health Care Management Science, Springer, vol. 14(1), pages 89-114, March.
    17. Jose M. Molina-Pariente & Erwin W. Hans & Jose M. Framinan, 2018. "A stochastic approach for solving the operating room scheduling problem," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 224-251, June.
    18. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2019. "Dynamic job assignment: A column generation approach with an application to surgery allocation," European Journal of Operational Research, Elsevier, vol. 272(1), pages 78-93.
    19. Eun, Joonyup & Kim, Sang-Phil & Yih, Yuehwern & Tiwari, Vikram, 2019. "Scheduling elective surgery patients considering time-dependent health urgency: Modeling and solution approaches," Omega, Elsevier, vol. 86(C), pages 137-153.
    20. 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.

    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:223:y:2012:i:2:p:573-584. 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: 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.