On complex hybrid flexible flowshop scheduling problems based on constraint programming

The complex hybrid flexible flowshop problems in the real-world industries scheduling were researched, including constraints of unrelated machines, skipping some stages etc. Though several researches were done to address some of the constraints, modeling these constraints was seldom done simultaneously. This paper modeled the problem in the perspective of constraint programming and solved the problem utilizing the Gecode system. The simulation results showed that our proposed method was efficiently and effectively on solving the complex hybrid flexible flowshop problems. It was the first proposed method to investigate and solve the hybrid flexible flowshop problems using constraint programming.