A novel strategy adaptive genetic algorithm with greedy local search for the permutation flowshop scheduling problem

Abstract

This article presents a novel Genetic Algorithm with a greedy local search operator that may solve a wide range of sequencing and scheduling discrete optimization problems efficiently. To analyze its performance, we have tested the algorithm on the Permutation Flow-shop Scheduling Problem (PFSSP). Here we present a novel crossover scheme coupled with an innovative mutation scheme that implements local search to facilitate rapid convergence. This novel GA variant provides better results compared to other heuristics, which is apparent from the experimental results and comparisons with other existing algorithms. © 2012 Springer-Verlag.