Online algorithms with foresight for radiotherapy patient scheduling

A radiotherapy treatment consists of a given number of radiation sessions, which should start before a specified due date and have a duration that varies based on the patient category. Waiting time is the main critical issue in the management of a radiotherapy health system: the time elapsed between the first consultation and the first treatment is typically rather long and delays have the potential to damage the health status of the patients. Then, an efficient use of available linacs is crucial to ensure the success of the treatment. In this paper, we deal with a Radiotherapy Patient Scheduling (RPS) problem at the pure-online level under the blocking policy, which divides work shifts into time slots of equal duration. We propose online algorithms that enable the scheduling of a sequence of appointments for each patient, all at the same time slot each day, whenever a patient needs to commence a series of radiotherapy sessions. Considering a realistic and patient-centered operational context, the problem becomes highly challenging, even in its offline setting. We address this problem by introducing the concept of online optimisation with foresight, which is the common framework of the proposed approaches. The rationale behind foresight is to take real-time decisions under uncertainty by exploiting the partial knowledge of the optimal solution structure. A quantitative analysis shows that the proposed algorithms outperform two competitor algorithms inspired by the literature. Furthermore, the exploitation of a pattern observed in the offline solutions of the problem (implicit foresight) results to be more flexible and effective than using a solution structure given by integer linear programs on the most likely scenario (explicit foresight). • Novel patient-centered approach to radiotherapy scheduling under uncertainty. • Introduced online optimisation with foresight to improve real-time scheduling decisions. • Three ILP models minimise waiting times, maximise linac utilisation, and reduce slot waste. • Implicit foresight uses patterns from offline solutions to guide efficient online scheduling. • Implicit foresight algorithm outperforms baseline methods, reducing patient waiting times.

Authors

Institutions

Publication Details

Journal
Computers & Operations Research
Published
2025-05-27
DOI
https://doi.org/10.1016/j.cor.2025.107132
Primary Topic
Healthcare Operations and Scheduling Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online algorithms with foresight for radiotherapy patient scheduling

Davide Duma, Giuseppe Squillace, Roberto Aringhieri
Computers & Operations Research
Healthcare Operations and Scheduling Optimization
article

Online algorithms with foresight for radiotherapy patient scheduling

Davide Duma, Giuseppe Squillace, Roberto Aringhieri
article en

Abstract

A radiotherapy treatment consists of a given number of radiation sessions, which should start before a specified due date and have a duration that varies based on the patient category. Waiting time is the main critical issue in the management of a radiotherapy health system: the time elapsed between the first consultation and the first treatment is typically rather long and delays have the potential to damage the health status of the patients. Then, an efficient use of available linacs is crucial to ensure the success of the treatment. In this paper, we deal with a Radiotherapy Patient Scheduling (RPS) problem at the pure-online level under the blocking policy, which divides work shifts into time slots of equal duration. We propose online algorithms that enable the scheduling of a sequence of appointments for each patient, all at the same time slot each day, whenever a patient needs to commence a series of radiotherapy sessions. Considering a realistic and patient-centered operational context, the problem becomes highly challenging, even in its offline setting. We address this problem by introducing the concept of online optimisation with foresight, which is the common framework of the proposed approaches. The rationale behind foresight is to take real-time decisions under uncertainty by exploiting the partial knowledge of the optimal solution structure. A quantitative analysis shows that the proposed algorithms outperform two competitor algorithms inspired by the literature. Furthermore, the exploitation of a pattern observed in the offline solutions of the problem (implicit foresight) results to be more flexible and effective than using a solution structure given by integer linear programs on the most likely scenario (explicit foresight). • Novel patient-centered approach to radiotherapy scheduling under uncertainty. • Introduced online optimisation with foresight to improve real-time scheduling decisions. • Three ILP models minimise waiting times, maximise linac utilisation, and reduce slot waste. • Implicit foresight uses patterns from offline solutions to guide efficient online scheduling. • Implicit foresight algorithm outperforms baseline methods, reducing patient waiting times.

Computers & Operations ResearchVol. 182
IMT School for Advanced Studies Lucca (IT), University of Pavia (IT), University of Turin (IT)
Openalex Percentile: Top 81%
Healthcare Operations and Scheduling Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.