A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem

The Job Shop Scheduling Problem (JSP) is a combinatorial optimization problem cataloged as type NP-Hard. To solve this problem, several heuristics and metaheuristics have been used. In order to minimize the makespan, we propose a Memetic Algorithm (MA), which combines the exploration of the search space by a Genetic Algorithm (GA), and the exploitation of the solutions using a local search based on the neighborhood structure of Nowicki and Smutnicki. The genetic strategy uses an operation-based representation that allows generating feasible schedules, and a selection probability of the best individuals that are crossed using the JOX operator. The results of the implementation show that the algorithm is competitive with other approaches proposed in the literature.

• Fecha de publicación: 2017
• Institución: Universidad Pedagógica y Tecnológica de Colombia
• Repositorio: RiUPTC: Repositorio Institucional UPTC
• Idioma: eng
• OAI Identifier: oai:repositorio.uptc.edu.co:001/14168
• Acceso en línea: https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5776; https://repositorio.uptc.edu.co/handle/001/14168
• Palabra clave: Job Shop Schedule; local search; memetic algorithm; metaheuristics
• License: http://purl.org/coar/access_right/c_abf211