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.
es_ES
Patrocinador
dc.description.sponsorship
Institute Complex Engineering Systems
ICM P-05-004-F
CONICYT FBO16