2020
DOI: 10.1007/s00500-020-05156-4
|View full text |Cite
|
Sign up to set email alerts
|

Patient scheduling with deteriorating treatment duration and maintenance activity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 52 publications
0
2
0
Order By: Relevance
“…Gocgun (2018) developed a simulation-based approximate dynamic programming approach to solve the dynamic patient scheduling problem with the consideration of cancellation of treatments. Shao et al (2020) first investigated the radiotherapy scheduling for brachytherapy patients considering maintenance activity and a GCSA algorithm was designed to minimize the maximum completion time. In this paper, we further consider patients setup time with the objective to maximize the overall treatment value and a column generation approach is proposed to solve the problem effectively.…”
Section: Radiotherapy Schedulingmentioning
confidence: 99%
“…Gocgun (2018) developed a simulation-based approximate dynamic programming approach to solve the dynamic patient scheduling problem with the consideration of cancellation of treatments. Shao et al (2020) first investigated the radiotherapy scheduling for brachytherapy patients considering maintenance activity and a GCSA algorithm was designed to minimize the maximum completion time. In this paper, we further consider patients setup time with the objective to maximize the overall treatment value and a column generation approach is proposed to solve the problem effectively.…”
Section: Radiotherapy Schedulingmentioning
confidence: 99%
“…Two main partially overlapping groups of papers can be distinguished within it. The first group discusses optimization problems and algorithms including local, global, and multi-criteria optimization (see Franchini et al 2020;Ž ilinskas and Litvinas 2020;Nesterov 2020;Posypkin et al 2020;Shao et al 2020;De Leone et al 2020;Capuano et al 2020;Lančinskas et al 2020;Sergeyev et al 2020;Crisci et al 2020;Cavallaro et al 2020;Astorino and Fuduli 2020;Candelieri et al 2020). The second group of papers (see D'Alotto 2020; Pepelyshev and Zhigljavsky 2020;Falcone et al 2020;Amodio et al 2020;Gangle et al 2020;De Leone et al 2020;Astorino and Fuduli 2020) deals with problems and algorithms using the already mentioned recent computational framework allowing one to work with different infinities and infinitesimals numerically.…”
mentioning
confidence: 99%