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...
Príomhchruthaitheoirí: | Lamos-Díaz, Henry, Aguilar-Imitola, Karin, Pérez-Díaz, Yuleiny Tatiana, Galván-Núñez, Silvia |
---|---|
Formáid: | Online |
Teanga: | eng |
Foilsithe / Cruthaithe: |
Universidad Pedagógica y Tecnológica de Colombia
2017
|
Ábhair: | |
Rochtain ar líne: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5776 |
- Míreanna comhchosúla
-
Metaheuristic algorithms for building Covering Arrays: A review
de réir: Timaná-Peña, Jimena Adriana, et al.
Foilsithe / Cruthaithe: (2016) -
Relative Average Deviation as Measure of Robustness in the Stochastic Project Scheduling Problem
de réir: Ortiz-Pimiento, Néstor Raúl, et al.
Foilsithe / Cruthaithe: (2019) -
Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
de réir: Quemá-Taimbud, Nelson-Enrique, et al.
Foilsithe / Cruthaithe: (2023) -
Distribution and Spatial Segregation of Shopping Centers in Cancun, Quintana Roo (1979–2019)
de réir: Fonseca Chicho, Edgar Elias, et al.
Foilsithe / Cruthaithe: (2020) -
Ventajas de la aplicación de las metaheurísticas, algoritmos genéticos y búsqueda tabú en la solución de problemas de Job Shop Scheduling
de réir: Alvarado Benavides, Fredy Enrique, et al.
Foilsithe / Cruthaithe: (2021)