Exhaustive approaches to optimize the robustness of surgeries scheduling

Overview & Synopsis

This thesis deals with a combinatorial optimization problem that is the Operating Rooms’ (ORs) planning and scheduling. We developed two approaches of resolution based on mathematical programming. The approaches developed try to increase the ORs’ utilization by bringing up the number of operations performed, while reducing the makespan time. To achieve this, we developed two mathematical models, resorting to the solver Cplex, and to the algorithm of optimization PSO, associated with a simulation Monte Carlo, for the resolution of these models. Moreover, these resolution approaches determine the sequence of selected patients in each OR for each day while computing the performance indicators. Then, they provide a computational analysis on a set of instances based on real and random data. The results obtained are compared with the real instances and have shown an impressive improvement.