TY - JOUR
T1 - Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries
AU - Latorre-Núñez, Guillermo
AU - Lüer-Villagra, Armin
AU - Marianov, Vladimir
AU - Obreque, Carlos
AU - Ramis, Francisco
AU - Neriz, Liliana
N1 - Funding Information:
We thank the valuable comments made by a referee, which helped significantly improving the quality of the paper. Lüer-Villagra and Marianov gratefully acknowledge support by the Institute Complex Engineering Systems through grants ICM P-05-004-F and CONICYT FBO16 .
PY - 2016/7/1
Y1 - 2016/7/1
N2 - Surgery rooms are among the most expensive resources in hospitals and clinics. Their scheduling is difficult because, in addition to the surgical room itself, each surgery requires a particular combination of human resources, as well as different pieces of equipment and materials. Furthermore, after each surgery, a post-anesthesia bed is required for the patient to recover. Finally, in addition to planned surgeries, the scheduling must be made in such a way as to accommodate the emergency surgeries that may arrive during each day, which must be attended within a limited time. We address the surgery scheduling problem considering simultaneously, for the first time, the operating rooms, the post anesthesia recovery, the resources required by the surgery and the possible arrival of emergency surgeries. We propose an integer linear programming model that allows finding optimal solutions for small size instances, we transform it to use constraint programming, and develop a metaheuristic based on a genetic algorithm and a constructive heuristic, that solves larger size instances. Finally, we present numerical experiments.
AB - Surgery rooms are among the most expensive resources in hospitals and clinics. Their scheduling is difficult because, in addition to the surgical room itself, each surgery requires a particular combination of human resources, as well as different pieces of equipment and materials. Furthermore, after each surgery, a post-anesthesia bed is required for the patient to recover. Finally, in addition to planned surgeries, the scheduling must be made in such a way as to accommodate the emergency surgeries that may arrive during each day, which must be attended within a limited time. We address the surgery scheduling problem considering simultaneously, for the first time, the operating rooms, the post anesthesia recovery, the resources required by the surgery and the possible arrival of emergency surgeries. We propose an integer linear programming model that allows finding optimal solutions for small size instances, we transform it to use constraint programming, and develop a metaheuristic based on a genetic algorithm and a constructive heuristic, that solves larger size instances. Finally, we present numerical experiments.
KW - Constraint programming
KW - Emergency surgeries
KW - Genetic algorithm
KW - Hybrid flow shop
KW - Operating room scheduling
UR - http://www.scopus.com/inward/record.url?scp=84969497783&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2016.05.016
DO - 10.1016/j.cie.2016.05.016
M3 - Article
AN - SCOPUS:84969497783
SN - 0360-8352
VL - 97
SP - 248
EP - 257
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
ER -