INVESTIGADORES
TOHME Fernando Abel
artículos
Título:
A Memetic Algorithm based on a NSGAII scheme for the Flexible Job-Shop Scheduling Problem
Autor/es:
FRUTOS, MARIANO; OLIVERA, ANA CAROLINA; TOHMÉ, FERNANDO
Revista:
ANNALS OF OPERATIONS RESEARCH
Editorial:
SPRINGER
Referencias:
Lugar: Berlin; Año: 2010 vol. 181 p. 745 - 765
ISSN:
0254-5330
Resumen:
The Flexible Job-Shop Scheduling Problem is concerned with the determination of asequence of jobs, consisting of many operations, on different machines, satisfying several parallelgoals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated SortingGenetic Algorithm II) acting on two chromosomes, to solve this problem. The algorithm adds, tothe genetic stage, a local search procedure (Simulated Annealing). We have assessed its efficiencyby running the algorithm on multiple objective instances of the problem. We draw statistics fromthose runs, which indicate that this Memetic Algorithm yields good and low-cost solutions.
