Abstract
In this paper we propose a heuristic approach that computes the order in which patients will be treated in an ambulatory chemotherapy center. Each patient follows an individual treatment plan that fixes dates for series of drug injections separated by recovery periods. The daily care process has three steps: consultation with the oncologist, drug preparation in the pharmacy and drug injection in medical beds. The facility closes after the last injection. As drug injection varying considerably in duration—from 15 min to 6 h—bad schedules lead to excessive overtime. In addition, after the consultation the oncologist may decide to cancel the injection because of a weak patient’s health condition. In the current setting of the chemotherapy facility we work with, First Come First Served policy controls the care process. In this study, we propose to compute a common priority list of patients for consultation and injection phases. A unique list of patients is a simple tool used by nurses to manage the flow of patients and to react to uncertain events. A GRASP algorithm is developed to compute optimized list of patients in few seconds as the operating planning context requires. Two objectives are considered; the closing time and the overworking time of the facility. Numerical experiments show that our GRASP is able to quickly reach near optimal solutions and that list of patients policy performance is comparable to more complex scheduling policies. Benchmark data sets are built based on historical data of the French chemotherapy facility, ICL in Saint-Étienne.
Similar content being viewed by others
Notes
Institut de Cancérologie Lucien Neuwirth.
References
Ahmed Z, ElMekkawy T, Bates S (2011) Developing an efficient scheduling template of a chemotherapy treatment unit: a case study. Australas Med J 4(10):575
Athawale S (2015) Chemotherapy appointment scheduling and operations planning. Ph.D. thesis, The University of Akron
Berg BP, Denton BT, Erdogan SA, Rohleder T, Huschka T (2014) Optimal booking and scheduling in outpatient procedure centers. Comput Oper Res 50:24–37
Chen B, Vestjens AP (1997) Scheduling on identical machines: how good is lpt in an on-line setting? Oper Res Lett 21(4):165–169
Dobish R (2003) Next-day chemotherapy scheduling: a multidisciplinary approach to solving workload issues in a tertiary oncology center. J Oncol Pharm Pract 9(1):37–42
Erdogan SA, Gose A, Denton BT (2015) Online appointment sequencing and scheduling. IIE Trans 47(11):1267–1286
Feo TA, Resende MG (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67–71
Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129
Gocgun Y, Puterman ML (2014) Dynamic scheduling with due dates and time windows: an application to chemotherapy patient appointment booking. Health Care Manag Sci 17(1):60–76
Gupta D, Denton B (2008) Appointment scheduling in health care: challenges and opportunities. IIE Trans 40(9):800–819
Hahn-Goldberg S, Beck JC, Carter MW, Trudeau M, Sousa P, Beattie K (2014a) Solving the chemotherapy outpatient scheduling problem with constraint programming. J Appl Oper Res 6(3):135–144
Hahn-Goldberg S, Carter MW, Beck JC, Trudeau M, Sousa P, Beattie K (2014b) Dynamic optimization of chemotherapy outpatient scheduling with uncertainty. Health Care Manag Sci 17(4):379–392
Hart JP, Shogan AW (1987) Semi-greedy heuristics: an empirical study. Oper Res Lett 6(3):107–114
Jiang R, Shen S, Zhang Y (2017) Integer programming approaches for appointment scheduling with random no-shows and service durations. Oper Res 65(6):1638–1656
Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–68
Lau PK, Watson MJ, Hasani A (2014) Patients prefer chemotherapy on the same day as their medical oncology outpatient appointment. J Oncol Pract 10(6):e380–e384
Le MD, Nguyen N, Minh H, Baril C, Gascon V, Dinh TB (2015) Heuristics to solve appointment scheduling in chemotherapy. In: IEEE RIVF international conference on computing and communication technologies-research, innovation, and vision for the future (RIVF). IEEE, pp 59–64
Li K, Willis R (1992) An iterative scheduling technique for resource-constrained project scheduling. Eur J Oper Res 56:370–379
Özdamar L, Ulusoy G (1996) A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis. Eur J Oper Res 89:400–407
Pérez E, Ntaimo L, Malavé CO, Bailey C, McCormack P (2013) Stochastic online appointment scheduling of multi-step sequential procedures in nuclear medicine. Health Care Manag Sci 16(4):281–299
Sadki A, Xie X, Chauvin F (2010) Patients assignment for an oncology outpatient unit. In: IEEE conference on automation science and engineering (CASE). IEEE, pp 891–896
Sadki A, Xie X, Chauvin F (2011) Appointment scheduling of oncology outpatients. In: IEEE conference on automation science and engineering (CASE). IEEE, pp 513–518
Sadki A, Xie X, Chauvin F (2013) Planning oncologists of ambulatory care units. Decis Support Syst 55(2):640–649
Samorani M, LaGanga LR (2015) Outpatient appointment scheduling given individual day-dependent no-show predictions. Eur J Oper Res 240(1):245–257
Valls V, Ballestín F, Quintanilla S (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165:375–386
Yokouchi M, Aoki S, Sang H, Zhao R, Takakuwa S (2012) Operations analysis and appointment scheduling for an outpatient chemotherapy department. In: Proceedings of the winter simulation conference, p 81
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Garaix, T., Rostami, S. & Xie, X. Daily outpatient chemotherapy appointment scheduling with random deferrals. Flex Serv Manuf J 32, 129–153 (2020). https://doi.org/10.1007/s10696-018-9326-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10696-018-9326-x