Constraint programing for solving four complex flexible shop scheduling problems

Basic and Applied Basic Research Foundation of Guangdong Province of China, Grant/Award Number: 2019A1515110399; Research Fund Project of Liaocheng University, Grant/Award Number: 318052059; National Natural Science Foundation of China, Grant/Award Number: 51705263; Project of International Cooperation and Exchanges NSFC, Grant/Award Number: 51861165202 Abstract In recent years, with the advent of robust solvers such as Cplex and Gurobi, constraint programing (CP) has been widely applied to a variety of scheduling problems. This paper presents CP models for formulating four scheduling problems with minimal makespan and complex constraints: the no‐wait hybrid flow shop scheduling problem, the hybrid flow shop scheduling problem with sequence‐dependent setup times, the flexible job shop scheduling problem with worker flexibility and the semiconductor final testing problem. The advantages of CP method in solving these four complex scheduling problems are explored. Finally, a set of benchmark instances are adopted to demonstrate the effectiveness and efficiency of the CP method. Experiment results show that the proposed CP models outperform existing algorithms; in particular, several best‐known solutions of benchmark instances are improved by our CP method.

[1]  Xinyu Li,et al.  A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem , 2020, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[2]  Raymond Chiong,et al.  A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility , 2019, Int. J. Prod. Res..

[3]  Xinyu Shao,et al.  More MILP models for hybrid flow shop scheduling problem and its extended problems , 2020, Int. J. Prod. Res..

[4]  Holger Voos,et al.  Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem , 2020, Comput. Oper. Res..

[5]  Chaoyong Zhang,et al.  Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem , 2020, Comput. Ind. Eng..

[6]  M. Fatih Tasgetiren,et al.  Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption , 2020, Swarm Evol. Comput..

[7]  Juan M. Novas,et al.  Production scheduling and lot streaming at flexible job-shops environments using constraint programming , 2019, Comput. Ind. Eng..

[8]  Xinyu Shao,et al.  MILP models for energy-aware flexible job shop scheduling problem , 2019, Journal of Cleaner Production.

[9]  Xinyu Shao,et al.  Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines , 2018, Int. J. Prod. Res..

[10]  Chaoyong Zhang,et al.  Mathematical Modeling and Optimization of Energy-Conscious Flexible Job Shop Scheduling Problem With Worker Flexibility , 2019, IEEE Access.

[11]  Krzysztof Fleszar,et al.  Algorithms for the unrelated parallel machine scheduling problem with a resource constraint , 2018, Eur. J. Oper. Res..

[12]  Frank Werner,et al.  Flexible job shop scheduling with lot streaming and sublot size optimisation , 2018, Int. J. Prod. Res..

[13]  Ridvan Gedik,et al.  A constraint programming approach for solving unrelated parallel machine scheduling problem , 2018, Comput. Ind. Eng..

[14]  Wei Liu,et al.  A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility , 2018, Int. J. Prod. Res..

[15]  Petr Vilím,et al.  IBM ILOG CP optimizer for scheduling , 2018, Constraints.

[16]  Jun-Qing Li,et al.  An effective invasive weed optimization algorithm for scheduling semiconductor final testing problem , 2018, Swarm Evol. Comput..

[17]  Y. Bukchin,et al.  Constraint programming for solving various assembly line balancing problems , 2017, Omega.

[18]  Jing Zhang,et al.  A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility , 2017, J. Intell. Manuf..

[19]  Liang Gao,et al.  Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times , 2017, Appl. Math. Comput..

[20]  Liang Gao,et al.  A shuffled multi-swarm micro-migrating birds optimizer for a multi-resource-constrained flexible job shop scheduling problem , 2016, Inf. Sci..

[21]  Chase Rainwater,et al.  Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals , 2016, Eur. J. Oper. Res..

[22]  Ling Wang,et al.  A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem , 2016 .

[23]  Ye Xu,et al.  A hybrid estimation of distribution algorithm for the semiconductor final testing scheduling problem , 2015, J. Intell. Manuf..

[24]  Shengyao Wang,et al.  A knowledge-based multi-agent evolutionary algorithm for semiconductor final testing scheduling problem , 2015, Knowl. Based Syst..

[25]  Fariborz Jolai,et al.  No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach , 2015, J. Intell. Manuf..

[26]  M. Zandieh,et al.  TWO META-HEURISTIC ALGORITHMS FOR THE DUAL-RESOURCE CONSTRAINED FLEXIBLE JOB-SHOP SCHEDULING PROBLEM , 2015 .

[27]  F. Jolai,et al.  A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem , 2014, The International Journal of Advanced Manufacturing Technology.

[28]  Deming Lei,et al.  Variable neighbourhood search for dual-resource constrained flexible job shop scheduling , 2014 .

[29]  Shengyao Wang,et al.  A novel fruit fly optimization algorithm for the semiconductor final testing scheduling problem , 2014, Knowl. Based Syst..

[30]  R. Shafaei,et al.  An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines , 2014 .

[31]  Zhang Qi-lian.  Hybrid PSO-NEH algorithm for solving no-wait flexible flow shop scheduling problem , 2014 .

[32]  Fariborz Jolai,et al.  A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times , 2012 .

[33]  Ceyda Oguz,et al.  Parallel machine scheduling with flexible resources , 2012, Comput. Ind. Eng..

[34]  Pedro Gómez-Gasquet,et al.  An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan , 2012, Expert Syst. Appl..

[35]  Latif Salum,et al.  Rule-based modeling and constraint programming based solution of the assembly line balancing problem , 2012, Expert Syst. Appl..

[36]  Mitsuo Gen,et al.  A novel bi-vector encoding genetic algorithm for the simultaneous multiple resources scheduling problem , 2011, J. Intell. Manuf..

[37]  Zdenek Hanzálek,et al.  Solving production scheduling with earliness/tardiness penalties by constraint programming , 2011, J. Intell. Manuf..

[38]  Mostafa Zandieh,et al.  Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization , 2009, Comput. Ind. Eng..

[39]  Mostafa Zandieh,et al.  Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .

[40]  Fariborz Jolai,et al.  A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection , 2009 .

[41]  Chen-Fu Chien,et al.  Modeling semiconductor testing job scheduling and dynamic testing machine configuration , 2008, Expert Syst. Appl..

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

[43]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..