Cooperative metaheuristics for the permutation flowshop scheduling problem

Times Cited: 0 Article English Vallada, E Univ Politecn Valencia, Inst Informat Technol, Grp Sistemas Optimizac Aplicada, Edificio 7A,Camino Vera S-N, Valencia 46021, Spain Cited References Count: 37 370FW ELSEVIER SCIENCE BVPO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS AMSTERDAM

In this work, we propose cooperative metaheuristic methods for the permutation flowshop scheduling problem considering two objectives separately: total tardiness and makespan. We use the island model where each island runs an instance of the algorithm and communications start when the islands have reached certain level of evolution, that is, communication is not allowed from the beginning of the execution. Subsequent ones occur when new better solutions are found. We carry out an exhaustive comparison of the cooperative methods against the sequential counterparts running in completely comparable scenarios. Results have been carefully analysed by means of statistical procedures and we can conclude that the cooperative methods yield much better results than the sequential algorithms and state-of-the-art methods running in the same number of processors but without communications. The proposed cooperative schemes are easy to apply to other algorithms and problems.