2010
DOI: 10.1016/j.cor.2009.09.016
|View full text |Cite
|
Sign up to set email alerts
|

An elective surgery scheduling problem considering patient priority

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
56
0
3

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 107 publications
(59 citation statements)
references
References 36 publications
0
56
0
3
Order By: Relevance
“…First, an aggregated approach is followed in which clinical activities are assigned to big bucket periods with a length of one day. This is similar to Vissers et al [57] and Conforti et al [12] and differs from the detailed scheduling approaches of Min and Yih [34] and Pham and Klinkert [39]. However, Vissers et al [57] decide on the admission date of patients only and assume for the latter a fixed schedule.…”
Section: Single Resourcesmentioning
confidence: 81%
See 1 more Smart Citation
“…First, an aggregated approach is followed in which clinical activities are assigned to big bucket periods with a length of one day. This is similar to Vissers et al [57] and Conforti et al [12] and differs from the detailed scheduling approaches of Min and Yih [34] and Pham and Klinkert [39]. However, Vissers et al [57] decide on the admission date of patients only and assume for the latter a fixed schedule.…”
Section: Single Resourcesmentioning
confidence: 81%
“…We have classified each article with respect to the use of scarce clinical resources (single vs. multiple) and the consideration of risk (deterministic vs. stochastic). On a tactical planning level, Min and Yih [34] address the surgery scheduling problem for elective patients taking into account stochastic surgery durations and stochastic capacity of the surgical intensive care unit by employing a stochastic discrete program which is solved with the sample average approximation method. Vissers et al [57] consider the tactical patient mix optimization problem for a single specialty.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Methods: computer simulation [10,57,102,137,140,142,143,146,170,226,300,302,306,307,433,470,511], heuristics [10,13,83,131,136,175,177,225,226,256,306,308,341,416,422,455,486], Markov processes [196,228,365,381], mathematical programming [13,23,81,82,83,95,102,129,130,131,175,176,177,…”
Section: Methods: No Articles Foundmentioning
confidence: 99%
“…Methods: computer simulation [57,138,291,478], Markov processes [365], mathematical programming [3,4], literature review [49,224].…”
Section: Admission Controlmentioning
confidence: 99%
“…Model formulation and solution approach excess demand. Another approach to schedule patients based on medical priority uses dynamic programming [186]. In this model, a trade-off between surgery overtime and postponement costs result in a surgical schedule.…”
Section: Literaturementioning
confidence: 99%