Outpatient Appointment Optimization: A Case Study of a Chemotherapy Service
Source abstract
Abstract
In this paper, we study a complex outpatient planning problem in the chemotherapy department. The planning concerns sequences of patients’ treatment sessions subject to exact in-between resting periods (i.e., exact time-lags). The planning is constrained by the hospital infrastructure and the availability of medical staff (i.e., multiple time-varying resources’ availability). In order to maximize the patients’ service quality, the objective of the function considered is to minimize the total wait times, which is equivalent to the criteria for minimizing the total completion time. Our main contribution is a thorough analysis of this problem, using the Hybrid Flow Shop problem as a theoretical framework to study the problem. A novel Mixed Integer Linear Programming (MILP) is introduced. Concerning the resolution methods, priority-based heuristics and an adapted genetic algorithm (GA) are presented. Numerical experiments are conducted on historical data to compare the performances of the approximate resolution methods against the MILP solved by CPLEX. Numerical results confirm the performances of the proposed methods.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Healthcare Operations and Scheduling Optimization · Scheduling and Timetabling Solutions · Advanced Queuing Theory Analysis
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Opta LP S.A.S., 2 Rue Gustave Eiffel, 10430 Rosieres-pres-Troyes, France
Computer Sciences and Digital Society Laboratory (LIST3N), Université de Technologie de Troyes, 12 Rue Marie Curie, CS 42060, 10004 Troyes, France
Chaire Connected Innovation, Université de Technologie de Troyes, 12 Rue Marie Curie, 10004 Troyes, France
References (35)
Show source-provided references
1. Hesaraki, A.F. (2019). Tactical & Operational Models for Scheduling Chemotherapy Appointments. [Ph.D. Thesis, Technische Universiteit Eindhoven].
2. Tran, Q.N.H., Chehade, H., Nguyen, N.Q., Laplanche, D., Sanchez, S., Sadeghi, R., and Dugardin, F. (2020, January 17–19). Optimization of Chemotherapy Planning. Proceedings of the International Conference on Optimization and Learning (OLA2020), Cádiz, Spain.
3. Scheduling Patient Appointments via Multilevel Template: A Case Study in Chemotherapy10.1016/j.orhc.2014.02.002 ↗
4. Hammer, P.L., Johnson, E.L., and Korte, B.H. (1979). Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, Elsevier. Volume 5, Discrete Optimization II.
5. Scheduling Subject to Resource Constraints: Classification and Complexity10.1016/0166-218X(83)90012-4 ↗
6. Weglarz, J. (2012). Project Scheduling: Recent Models, Algorithms and Applications, Springer Science & Business Media.
7. Permutation Flowshop Scheduling with Time Lag Constraints and Makespan Criterion10.1016/j.cie.2018.04.021 ↗
8. An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Generalized Precedence Relations10.1016/j.ejor.2011.12.019 ↗
9. Parallel Machine Scheduling to Minimize Total Completion Time with Release Dates Constraints10.1016/S1474-6670(17)39491-0 ↗
10. Lenstra, J.K. (1976). Sequencing by enumerative methods. [Ph.D. Thesis, Universiteit van Amsterdam].
11. Nguyen, N.Q., Yalaoui, F., Amodeo, L., Chehade, H., and Toggenburger, P. (2018). Electrical Vehicle Charging Coordination Algorithms Framework. Studies in Systems, Decision and Control, Springer International Publishing.10.1007/978-3-319-75690-5_16 ↗
12. Staff Scheduling and Rostering: A Review of Applications, Methods and Models10.1016/S0377-2217(03)00095-X ↗
13. The State of the Art of Nurse Rostering10.1023/B:JOSH.0000046076.75950.0b ↗
14. Appointment Scheduling in Health Care: Challenges and Opportunities10.1080/07408170802165880 ↗
15. A Categorisation of Nurse Rostering Problems10.1007/s10951-010-0211-z ↗
16. Appointment Planning and Scheduling in Outpatient Procedure Centers10.1007/978-1-4614-1734-7_6 ↗
17. Operational Research Techniques Applied throughout Cancer Care Services: A Review10.1080/20476965.2017.1414741 ↗
18. Outpatient Appointment Systems in Healthcare: A Review of Optimization Studies10.1016/j.ejor.2016.06.064 ↗
19. Literature Review on Multi-Appointment Scheduling Problems in Hospitals10.1016/j.ejor.2018.03.001 ↗
20. Solving an Integrated Employee Timetabling and Job-Shop Scheduling Problem via Hybrid Branch-and-Bound10.1016/j.cor.2008.08.013 ↗
21. Solving the Chemotherapy Outpatient Scheduling Problem with Constraint Programming
22. Acuity-Based Nurse Assignment and Patient Scheduling in Oncology Clinics10.1007/s10729-014-9313-z ↗
23. A Rotation-Based Branch-and-Price Approach for the Nurse Scheduling Problem10.1007/s12532-019-00172-4 ↗
24. Menting, J.A., and Menting, J. (2014). Planning and Scheduling under Uncertainty in Oncology Day Care. [Master Thesis, Eindhoven University of Technology].
25. Chemotherapy Operations Planning and Scheduling10.1080/19488300.2012.665155 ↗
26. Nguyen, N.T., Trawiński, B., Fujita, H., and Hong, T.P. (2016). Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models. Intelligent Information and Database Systems, Springer. Lecture Notes in Computer Science.10.1007/978-3-662-49390-8_28 ↗
27. Węglarz, J. (1999). Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. Project Scheduling: Recent Models, Algorithms and Applications, Springer.
28. Swamidass, P.M. (2000). Shortest Processing Time (SPT). Encyclopedia of Production and Manufacturing Management, Springer.10.1007/1-4020-0612-8 ↗
29. Alvarez-Valdes, R., and Tamarit, J.M. (1989). Heuristic Algorithms for Resource Constrained Project Scheduling: A Review and an Empirical Analysis. Advances in Project Scheduling, Elsevier.
30. Multi-Disciplinary Planning in Health Care: A Review10.1080/20476965.2018.1436909 ↗
31. Grefenstette, J.J. (1985, January 24–26). Genetic Algorithms for the Traveling Salesman Problem. Proceedings of the First International Conference on Genetic Algorithms and Their Applications, Pittsburg, PA, USA.
32. Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem
33. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators10.1023/A:1006529012972 ↗
34. Tran, Q.N.H. (2021, November 16). CHT-I. Available online: https://github.com/qnhant5010/CHT-I.
35. Wilhelmstötter, F. (2020, March 21). Jenetics: Java Genetic Algorithm Library. Available online: https://jenetics.io/.