A MEMETIC ALGORITHM BASED ON A NSGAII SCHEME FOR THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM
MARIANO FRUTOS; ANA C. OLIVERA; FERNANDO TOHMÉ
ANNALS OF OPERATIONS RESEARCH
Lugar: Netherlands; Año: 2010 vol. 181 p. 745 - 745
The Flexible Job-Shop Scheduling Problem is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying several parallel goals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated Sorting Genetic Algorithm II) acting on two chromosomes, to solve this problem. The algorithm adds, to the genetic stage, a local search procedure (Simulated Annealing). We have assessed its efficiency by running the algorithm on multiple objective instances of the problem. We draw statistics from those runs, which indicate that this Memetic Algorithm yields good and low-cost solutions.