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...
मुख्य लेखकों: | Lamos-Díaz, Henry, Aguilar-Imitola, Karin, Pérez-Díaz, Yuleiny Tatiana, Galván-Núñez, Silvia |
---|---|
स्वरूप: | Online |
भाषा: | eng |
प्रकाशित: |
Universidad Pedagógica y Tecnológica de Colombia
2017
|
विषय: | |
ऑनलाइन पहुंच: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5776 |
- समान संसाधन
-
Metaheuristic algorithms for building Covering Arrays: A review
द्वारा: Timaná-Peña, Jimena Adriana, और अन्य
प्रकाशित: (2016) -
Relative Average Deviation as Measure of Robustness in the Stochastic Project Scheduling Problem
द्वारा: Ortiz-Pimiento, Néstor Raúl, और अन्य
प्रकाशित: (2019) -
Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
द्वारा: Quemá-Taimbud, Nelson-Enrique, और अन्य
प्रकाशित: (2023) -
Distribution and Spatial Segregation of Shopping Centers in Cancun, Quintana Roo (1979–2019)
द्वारा: Fonseca Chicho, Edgar Elias, और अन्य
प्रकाशित: (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
द्वारा: Alvarado Benavides, Fredy Enrique, और अन्य
प्रकाशित: (2021)