A genetic algorithm with a Quasi-local search for the job shop problem with recirculation

Abstract

In this work we present a genetic algorithm for the job shop problem with recirculation. The genetic algorithm includes a local search procedure that is implemented as a genetic operator. This strategy differs from the memetic algorithm because it is not guaranteed that the local minimum is achieved in each iteration. © 2006 Springer.