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

ver descrição completa

Detalhes bibliográficos

Principais autores:	Henry Lamos-Díaz, Karin Aguilar-Imitola, Yuleiny Tatiana Pérez-Díaz, Silvia Galván-Núñez
Formato:	Artigo
Idioma:	Inglês
Publicado em:	Universidad Pedagógica y Tecnológica de Colombia 2017-01-01
Colecção:	Revista Facultad de Ingeniería
Assuntos:	Job Shop Schedule local search memetic algorithm metaheuristics
Acesso em linha:	http://revistas.uptc.edu.co/index.php/ingenieria/article/view/5776
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!