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.

[2]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[3]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[4]  Bart Selman,et al.  Constraint Programming for Distributed Planning and Scheduling , 2006, AAAI Spring Symposium: Distributed Plan and Schedule Management.

[5]  Mostafa Zandieh,et al.  A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems , 2010, J. Intell. Manuf..

[6]  Shigeru Fujimura,et al.  Study and application of scheduling method for just-in-time production in flexible job shops , 2011, 2011 IEEE International Conference on Industrial Engineering and Engineering Management.

[7]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[8]  Adriana Giret,et al.  Feasible distributed CSP models for scheduling problems , 2008, Eng. Appl. Artif. Intell..

[9]  Peter Nightingale.  Non-binary quantified CSP: algorithms and modelling , 2009, Constraints.

[10]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[11]  Bahman Naderi,et al.  A Variable Neighborhood Search for Hybrid Flexible Flowshops with Setup Times Minimizing Total Completion Time , 2008 .

[12]  R. Tavakkoli-Moghaddam,et al.  Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times , 2013, The International Journal of Advanced Manufacturing Technology.

[13]  Yi Tan,et al.  A real-time rescheduling heuristic using decentralized knowledge-based decisions for flexible flow shops with unrelated parallel machines , 2011, 2011 9th IEEE International Conference on Industrial Informatics.

[14]  Rubén Ruiz,et al.  Local Search in Complex Scheduling Problems , 2007, SLS.

[15]  Tadeusz Witkowski,et al.  Using GRASP for optimization of flow production in FJSP problem with transportation operations , 2012, 2012 8th International Conference on Natural Computation.

[16]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[17]  Rubén Ruiz,et al.  Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems , 2010, Int. J. Metaheuristics.

[18]  Bahman Naderi,et al.  Hybrid flexible flowshop problems: Models and solution methods , 2014 .