ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more efficient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most efficient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic 'common sense' rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

[1]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[2]  Angel A. Juan,et al.  Using Oriented Random Search to Provide a Set of Alternative Solutions to the Capacitated Vehicle Routing Problem , 2009 .

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

[4]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[5]  Cigdem Alabas-Uslu,et al.  A self-adaptive local search algorithm for the classical vehicle routing problem , 2011, Expert Syst. Appl..

[6]  Javier Faulin,et al.  Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands , 2011, Annals of Operations Research.

[7]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[8]  Maurício Resende,et al.  GRASP: Greedy Randomized Adaptive Search Procedures , 2003 .

[9]  Quan-Ke Pan,et al.  An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[10]  Sanja Petrovic,et al.  Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms , 2010, IEEE Congress on Evolutionary Computation.

[11]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[12]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[13]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[14]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

[15]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[16]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[17]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[18]  Maurice Clerc,et al.  MO-TRIBES, an adaptive multiobjective particle swarm optimization algorithm , 2011, Comput. Optim. Appl..

[19]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[20]  Stewart Robinson,et al.  Simulation model verification and validation: increasing the users' confidence , 1997, WSC '97.

[21]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[22]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[23]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[24]  Angel A. Juan,et al.  The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem , 2008 .

[25]  Manuel Mateo,et al.  Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems , 2007, Comput. Oper. Res..

[26]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[27]  M. Resende,et al.  GRASP: Greedy Randomized Adaptive Search Procedures , 2003 .

[28]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[29]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[30]  Xavier Tort-Martorell,et al.  Comparing three-step heuristics for the permutation flow shop problem , 2010, Comput. Oper. Res..

[31]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[32]  Mohamed Haouari,et al.  A computational study of the permutation flow shop problem based on a tight lower bound , 2005, Comput. Oper. Res..

[33]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..

[34]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

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

[36]  A. Kan Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[37]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[38]  Thomas Sttzle,et al.  Applying iterated local search to the permutation ow shop problem , 1998 .

[39]  Marcelo Seido Nagano,et al.  A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .

[40]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[41]  M. Yamashiro,et al.  Solving flow shop scheduling problems by quantum differential evolutionary algorithm , 2010 .

[42]  Pierre L'Ecuyer,et al.  Software for uniform random number generation: distinguishing the good and the bad , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[43]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[44]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[45]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[46]  S.M.A. Suliman,et al.  A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .

[47]  Seiji Yamada,et al.  An empirical performance evaluation of a parameter-free genetic algorithm for job-shop scheduling problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[48]  É. Taillard Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[49]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

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

[51]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.