Particle therapy patient scheduling with limited starting time variations of daily treatments

DOI10.1111/itor.12579WikidataQ129447996 ScholiaQ129447996MaRDI QIDQ6066719

Günther R. Raidl, Johannes Maschler

Publication date: 16 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

hybrid metaheuristiccancer treatmentparticle therapy patient schedulingiterated greedy metaheuristic

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Multi–stage process for chemotherapy scheduling and effective capacity determination ⋮ Comparing optimization methods for radiation therapy patient scheduling using different objectives ⋮ Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources

Cites Work

• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Optimization models for radiotherapy patient scheduling
• Note: A local-search heuristic for large set-covering problems
• An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem

This page was built for publication: Particle therapy patient scheduling with limited starting time variations of daily treatments