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...
| Main Authors: | , , , |
|---|---|
| פורמט: | Online |
| שפה: | eng |
| יצא לאור: |
Universidad Pedagógica y Tecnológica de Colombia
2017
|
| נושאים: | |
| גישה מקוונת: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5776 |
