MIP/CP Combined Model on Job-shop Scheduling Problem

The job-shop scheduling problem(JSSP) is a typically hard non-polynomial problem(NP-Hard) and a large number of papers focus on it.Firstly,the knowledge related to constraint programming and ILOG SOLVER are introduced in brief and then a constraint programming model of job-shop scheduling problem was presented in this paper.Then,a MIP/CP model was put forward by using the complementary strengths of MIP and CP.At last,a few illustration shown the MIP/CP model was very effective method by combining the MIP model and CP model.