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

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 s...

Full description

Bibliographic Details
Main Authors: Henry Lamos-Díaz, Karin Aguilar-Imitola, Yuleiny Tatiana Pérez-Díaz, Silvia Galván-Núñez
Format: Article
Language:English
Published: Universidad Pedagógica y Tecnológica de Colombia 2017-01-01
Series:Revista Facultad de Ingeniería
Subjects:
Job Shop Schedule
local search
memetic algorithm
metaheuristics
Online Access:http://revistas.uptc.edu.co/index.php/ingenieria/article/view/5776

Internet

http://revistas.uptc.edu.co/index.php/ingenieria/article/view/5776

Similar Items