A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems

The no-wait flow shop scheduling problem (NWFSP), as a typical NP-hard problem, has important ramifications in the modern industry. In this paper, a jigsaw puzzle inspired heuristic (JPA) is proposed for solving NWFSP with the objective of minimizing makespan. The core idea behind JPA is to find the best match for each job until all the jobs are scheduled in the set of process. In JPA, a waiting time matrix is constructed to measure the gap between two jobs. Then, a matching matrix based on the waiting time matrix is obtained. Finally, the optimal scheduling sequence is built by using the matching matrix. Experimental results on large-scale benchmark instances show that JPA is superior to the state-of-the-art heuristics.

[1]  Wei Li,et al.  An effective heuristic for no-wait flow shop production to minimize makespan , 2016 .

[2]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[3]  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..

[4]  Xia Zhu,et al.  Iterative search method for total flowtime minimization no-wait flowshop problem , 2015, Int. J. Mach. Learn. Cybern..

[5]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[6]  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.

[7]  Dipak Laha,et al.  A heuristic for no-wait flow shop scheduling , 2013 .

[8]  Tian Chen,et al.  An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects , 2018, Inf. Sci..

[9]  Jaya Sil,et al.  Particle Swarm Optimization with population adaptation , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[10]  Yi Zhang,et al.  A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem , 2018, Expert Syst. Appl..

[11]  Ali Allahverdi,et al.  No-wait flowshop scheduling problem with two criteria; total tardiness and makespan , 2018, Eur. J. Oper. Res..

[12]  Bernard Penz,et al.  Stability contracts between supplier and retailer: a new lot sizing model , 2015 .

[13]  Jose M. Framiñan,et al.  New hard benchmark for flowshop scheduling problems minimising makespan , 2015, Eur. J. Oper. Res..

[14]  Orhan Engin,et al.  A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems , 2018, Appl. Soft Comput..

[15]  Dipak Laha,et al.  An improved scheduling heuristic algorithm for no-wait flow shops on total flow time criterion , 2011, 2011 3rd International Conference on Electronics Computer Technology.

[16]  Huan Liu,et al.  An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem , 2018, Engineering Optimization.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[19]  Jatinder N. D. Gupta,et al.  A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops , 2016, Comput. Ind. Eng..

[20]  Amin Abedini,et al.  An effective and efficient heuristic for no-wait flow shop production to minimize total completion time , 2017, Comput. Ind. Eng..

[21]  Quan-Ke Pan,et al.  Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .

[22]  Vahid Riahi,et al.  A hybrid heuristic algorithm for the no-wait flowshop scheduling problem , 2015, 2015 International Symposium on Computer Science and Software Engineering (CSSE).

[23]  Hamed Samarghandi,et al.  A particle swarm optimisation for the no-wait flow shop problem with due date constraints , 2015 .

[24]  Wei Li,et al.  An improved heuristic for no-wait flow shop to minimize makespan , 2017 .

[25]  Kuo-Ching Ying,et al.  Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics , 2016 .

[26]  Hamed Samarghandi,et al.  On the exact solution of the no-wait flow shop problem with due date constraints , 2017, Comput. Oper. Res..

[27]  Shijin Wang,et al.  A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling , 2015 .

[28]  Hamed Samarghandi,et al.  An Enumeration Algorithm for the No-Wait Flow Shop Problem with Due Date Constraints , 2016 .

[29]  Rubén Ruiz,et al.  An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems , 2018, IEEE Transactions on Cybernetics.

[30]  Ponnuthurai N. Suganthan,et al.  An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem , 2013, 2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched).

[31]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

[32]  Rui Zhang,et al.  Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[33]  Marcelo Seido Nagano,et al.  An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times , 2014, Expert Syst. Appl..

[34]  H. Li,et al.  Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop , 2010, 2010 Chinese Control and Decision Conference.

[35]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[36]  Xin He,et al.  Quantum-inspired cuckoo co-search algorithm for no-wait flow shop scheduling , 2018, Applied Intelligence.

[37]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[38]  T. J. Breen,et al.  Biostatistical Analysis (2nd ed.). , 1986 .

[39]  Dechang Pi,et al.  A hybrid discrete optimization algorithm based on teaching-probabilistic learning mechanism for no-wait flow shop scheduling , 2016, Knowl. Based Syst..