Operating Theatre Scheduling Under Constraints

We present in this study some manufacturing systems scheduling constraints that we adapt to the operating theatre scheduling. The scheduling that should comply with all operating constraints, related to quality, to patients and numerous resources information can be considered as a two-stage hybrid flow shop problem without buffer. We confirmed the existence of the constraints after a large study with operating theatre managers at several hospitals. For resolution, we use two methods: Local search for constraint satisfaction in the initial feasible solution and Tabu search with restricted neighborhood system for Makespan Optimization. In one hand, we use yearly data from an existing multidisciplinary which has 3 operating rooms and 9 beds and releases 10 surgeries per day. In the other hand, we schedule others examples with different variables. The amelioration rates of both makespan and constraints conflict were interessting according to program execution time.