Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Yuleiny Tatiana Pérez-Díaz"'
Publikováno v:
Revista Facultad de Ingeniería, Vol 26, Iss 44, Pp 113-123 (2017)
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 (M
Externí odkaz:
https://doaj.org/article/d0ef7294c32340098df8d6d2eeb6781f
Publikováno v:
Revista Facultad de Ingeniería, Vol 26, Iss 44, Pp 113-123 (2017)
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 (M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::962ae46153613e598f3b0e69de0e1900
https://doi.org/10.19053/01211129.v26.n44.2017.5776
https://doi.org/10.19053/01211129.v26.n44.2017.5776