Optimization of production planning with resource allocation

This thesis presents an optimization problem with resource allocation. We need to assign workers and several resources to jobs which may require various skills while taking into account multiple constraints such as availability. We present two models to solve this problem: Constraint Programming and Mixed Integer Programming. Comparing their performances shows that Constraint Programming outperforms Mixed Integer Programming in most cases. However, combining the two models offers the best results as we can take advantage of Constraint Programming to find a good feasible solution quickly and Mixed Integer Programming to further optimize this solution.