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...
- Autores:
- Tipo de recurso:
- 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
- Rights
- License
- http://purl.org/coar/access_right/c_abf211