Skip to Main Content
The daily operating rooms scheduling is a highly constrained problem. It is also hard to find an optimal solution or at least high quality solutions. To solve this scheduling problem, we use the Â¿expressive powerÂ¿ of the constraint programming paradigm to include as many as possible real-life constraints in our model, such as the availability and the preferences of the staff. We develop a Â¿genericÂ¿ adaptive model which embeds most of the characteristics of the problem encountered in the literature as well as real-life constraints coming from practical problems in hospitals.