TY - JOUR
T1 - Scheduling elective surgery patients considering time-dependent health urgency
T2 - Modeling and solution approaches
AU - Eun, Joonyup
AU - Kim, Sang Phil
AU - Yih, Yuehwern
AU - Tiwari, Vikram
N1 - Funding Information:
The authors sincerely thank the associate editor and two anonymous reviewers for their constructive comments and suggestions to improve this paper. Joonyup Eun would like to acknowledge the post-doctoral research support from the Vanderbilt Department of Anesthesiology Research Fund.
Publisher Copyright:
© 2018 Elsevier Ltd
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2019/7
Y1 - 2019/7
N2 - This paper describes an operating room planning problem in which patients have different severity levels when they are diagnosed, and patient health condition deteriorates with the increase of waiting time. In addition, uncertainty in surgery durations is incorporated in this problem. A stochastic mixed integer program is proposed to optimize the assignment of surgeries considering the worst patient health condition among all patients waiting for surgeries and total overtime that exceeds the available time durations allotted for surgeries. This paper presents three solution approaches: the sample average approximation method, a fastest ascent local search, and a tabu search. These three solution approaches are evaluated in the computational study and the results show that the tabu search provides effective solutions within reasonable computation times.
AB - This paper describes an operating room planning problem in which patients have different severity levels when they are diagnosed, and patient health condition deteriorates with the increase of waiting time. In addition, uncertainty in surgery durations is incorporated in this problem. A stochastic mixed integer program is proposed to optimize the assignment of surgeries considering the worst patient health condition among all patients waiting for surgeries and total overtime that exceeds the available time durations allotted for surgeries. This paper presents three solution approaches: the sample average approximation method, a fastest ascent local search, and a tabu search. These three solution approaches are evaluated in the computational study and the results show that the tabu search provides effective solutions within reasonable computation times.
KW - Operating room planning
KW - Pairwise interchange heuristics
KW - Patient health condition
KW - Sample average approximation
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=85050987413&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050987413&partnerID=8YFLogxK
U2 - 10.1016/j.omega.2018.07.007
DO - 10.1016/j.omega.2018.07.007
M3 - Article
AN - SCOPUS:85050987413
VL - 86
SP - 137
EP - 153
JO - Omega (United Kingdom)
JF - Omega (United Kingdom)
SN - 0305-0483
ER -