An enhanced greedy random adaptive search procedure with path-relinking for no-wait flowshop problem with setup times

In this paper, we consider the no-wait flowshop scheduling problem with sequence-dependent setup times to minimize makespan, which is widespread in industries. An enhanced greedy random adaptive search procedure is combined with the Path- Relinking and the GRPEP method is proposed for the problem under study. An evolutionary local search algorithm is integrated to improve the exploration of the search process. Two local search methods, with and without memory, are introduced to improve the intensification. An ageing strategy is developed to increase the diversification. The proposed algorithm is compared with existing approaches for the considered problem and some recent effective algorithms for flowshop scheduling problems with sequence-dependent setup times on benchmark instances. Experimental results show that GRPEP outperforms all the compared meta-heuristics with the same CPU-times. GRPEP obtains better solutions than the compared heuristics

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

[2]  Yuping Wang,et al.  Multiobjective bilevel optimization for production-distribution planning problems using hybrid genetic algorithm , 2014, Integr. Comput. Aided Eng..

[3]  Hugues Delmaire,et al.  REACTIVE GRASP AND TABU SEARCH BASED HEURISTICS FOR THE SINGLE SOURCE CAPACITATED PLANT LOCATION PROBLEM , 1999 .

[4]  Marcelo Seido Nagano,et al.  A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem , 2011 .

[5]  Graham Cormode,et al.  Sequence distance embeddings , 2003 .

[6]  Christopher M. Schlick,et al.  Modelling and simulation of the task scheduling behavior in collaborative product development process , 2013, Integr. Comput. Aided Eng..

[7]  Rubén Ruiz,et al.  Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..

[8]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[9]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[10]  Andreas Fink,et al.  Fitness landscape analysis for the no-wait flow-shop scheduling problem , 2012, J. Heuristics.

[11]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[12]  Philippe Lacomme,et al.  A GRASP×ELS approach for the capacitated location-routing problem , 2010, Comput. Oper. Res..

[13]  Sebastián Ventura,et al.  Reducing gaps in quantitative association rules: A genetic programming free-parameter algorithm , 2014, Integr. Comput. Aided Eng..

[14]  Christian Prins,et al.  A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[15]  Lucio Bianco,et al.  Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates , 1999 .

[16]  Rubén Ruiz,et al.  Some effective heuristics for no-wait flowshops with setup times to minimize total completion time , 2007, Ann. Oper. Res..

[17]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[18]  Giovanni Iacca,et al.  Multi-Strategy coevolving aging Particle Optimization , 2014, Int. J. Neural Syst..

[19]  Ali Allahverdi,et al.  Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times , 2001, J. Oper. Res. Soc..

[20]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[21]  Asim Karim,et al.  Construction Scheduling, Cost Optimization and Management , 2001 .

[22]  S. Ronald,et al.  More distance functions for order-based encodings , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[23]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..

[24]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications , 2010 .

[25]  Weiming Shen,et al.  Scheduling multi-operation jobs in partially overlapping systems , 2006, Int. J. Comput. Integr. Manuf..

[26]  Bassem Jarboui,et al.  New Greedy Randomized Adaptive Search Procedure based on differential evolution algorithm for solving no-wait flowshop scheduling problem , 2013, 2013 International Conference on Advanced Logistics and Transport.

[27]  Mohammad Mirabi,et al.  Ant colony optimization technique for the sequence-dependent flowshop scheduling problem , 2011 .

[28]  Tie-Jun Wu,et al.  A computational intelligence optimization algorithm: Cloud drops algorithm , 2014, Integr. Comput. Aided Eng..

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

[30]  Ronald G. McGarvey,et al.  Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated , 2004, J. Oper. Res. Soc..

[31]  Luciana S. Buriol,et al.  Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions , 2006 .

[32]  Philippe Lacomme,et al.  A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints , 2013, Eng. Appl. Artif. Intell..

[33]  José Luis González Velarde,et al.  A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..

[34]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[35]  John M. Wilson,et al.  Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops , 2010, Comput. Ind. Eng..

[36]  Celso C. Ribeiro,et al.  Heuristics for the mirrored traveling tournament problem , 2007, Eur. J. Oper. Res..

[37]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[38]  Mauricio G. C. Resende,et al.  GRASP: basic components and enhancements , 2011, Telecommun. Syst..

[39]  Li Xiao,et al.  Objective Increment Based Iterative Greedy Heuristic for No-Wait Flowshops with Total Flowtime Minimization , 2009 .

[40]  Philippe Lacomme,et al.  A GRASP × ELS approach for the job-shop with a web service paradigm packaging , 2014, Expert Syst. Appl..

[41]  Aminah Robinson Fayek,et al.  A multi-criteria optimization framework for industrial shop scheduling using fuzzy set theory , 2010, Integr. Comput. Aided Eng..

[42]  Hojjat Adeli,et al.  Resource Scheduling Using Neural Dynamics Model of Adeli and Park , 2001 .