2017
DOI: 10.1007/s10589-017-9947-0
|View full text |Cite
|
Sign up to set email alerts
|

An efficient computational method for large scale surgery scheduling problems with chance constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…However, in an Adaptive Allocation Scheduling Problem, with consideration of disruptions, reassigning decisions (i.e., planning phase decisions) should be made along with rescheduling and resequencing decisions (i.e., scheduling phase decisions), preferably with limited changes in the preliminary schedule. There is quite some earlier work on Allocation Scheduling Problems with making assignment decisions along with (i) daily or (ii) weekly scheduling and sequencing decisions, e.g., (i): Jebali, Alouane, and Ladet (2006), Denton, Viapiano, and Voglet (2007), Pham and Klinkert (2008), Batun, Denton, Huschka, and Schaefer (2011), Ghazalbash, Sepehri, Shadpour, and Atighehchian (2012), Meskens, Duvivier, and Hanset (2013), Xiang, Yin, and Lim (2015), Latorre-Núñez et al (2016), and Bam, Denton, van Oyen, and Cowen (2017), (ii): Guinet and Chaabane (2003), Roland, Di Martinelly, Riane, and Pochet (2010), Fei, Meskens, and Chu (2006), Fei et al (2010), Vaz Pato (2012, Marques, Captivo, andPato (2014), Molina-Pariente, Fernandez-Viagas, and Framinan (2015), Roshanaei, Luong, Aleman, and Urbach (2017), and Noorizadegan and Seifi (2018). But the concept of adaptivity to unexpected disruptions has not been addressed in these researches, thus, reviewing them in detail is beyond the scope of this study.…”
Section: Introductionmentioning
confidence: 99%
“…However, in an Adaptive Allocation Scheduling Problem, with consideration of disruptions, reassigning decisions (i.e., planning phase decisions) should be made along with rescheduling and resequencing decisions (i.e., scheduling phase decisions), preferably with limited changes in the preliminary schedule. There is quite some earlier work on Allocation Scheduling Problems with making assignment decisions along with (i) daily or (ii) weekly scheduling and sequencing decisions, e.g., (i): Jebali, Alouane, and Ladet (2006), Denton, Viapiano, and Voglet (2007), Pham and Klinkert (2008), Batun, Denton, Huschka, and Schaefer (2011), Ghazalbash, Sepehri, Shadpour, and Atighehchian (2012), Meskens, Duvivier, and Hanset (2013), Xiang, Yin, and Lim (2015), Latorre-Núñez et al (2016), and Bam, Denton, van Oyen, and Cowen (2017), (ii): Guinet and Chaabane (2003), Roland, Di Martinelly, Riane, and Pochet (2010), Fei, Meskens, and Chu (2006), Fei et al (2010), Vaz Pato (2012, Marques, Captivo, andPato (2014), Molina-Pariente, Fernandez-Viagas, and Framinan (2015), Roshanaei, Luong, Aleman, and Urbach (2017), and Noorizadegan and Seifi (2018). But the concept of adaptivity to unexpected disruptions has not been addressed in these researches, thus, reviewing them in detail is beyond the scope of this study.…”
Section: Introductionmentioning
confidence: 99%
“…Wang et al [31] proposed a distributionally robust chance-constrained model for the surgery planning problem with stochastic surgery durations. Noorizadegan and Seifi [23] proposed a CCP model for the surgery planning problem with uncertain surgery durations. Kamran et al [12] proposed a two-stage stochastic model with chance constraints on OR overtime for the advance scheduling problem.…”
Section: Introductionmentioning
confidence: 99%
“…Second, a majority of the models have neglected the importance of minimizing the stochastic second-stage costs. Their primary focus has been on providing schedules within the specified risk tolerances while also aiming to minimize deterministic performance measures, such as fixed OR opening costs [5], [23]. Unlike existing approaches, this paper proposes a chance-constrained model that aims to minimize both deterministic and stochastic costs for the OR scheduling problem.…”
Section: Introductionmentioning
confidence: 99%