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...
Guardat en:
| Publicat a: | Facultad de Ingeniería |
|---|---|
| Autors principals: | , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Universidad Pedagógica y Tecnológica de Colombia
2017
|
| Matèries: | |
| Accés en línia: | https://www.redalyc.org/articulo.oa?id=413954884009 https://www.redalyc.org/journal/4139/413954884009/ https://www.redalyc.org/journal/4139/413954884009/html/ https://www.redalyc.org/journal/4139/413954884009/413954884009.epub https://www.redalyc.org/journal/4139/413954884009/movil |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|