Comparison of two models to schedule the operating theatre

The daily scheduling of the operating theatre is a highly constrained problem. Consequently, it is also hard to find an optimal solution or at least high quality solutions in reasonable time. Through the various human and material resources, we evaluate two models that take into account a maximum of constraints encountered in real life problems. The performance of these two models are compared to determine which is the best to add a maximum of these constraints when considering the descriptive power of the two underlying paradigms, which are the mixed-integer and constraint programming