- Tytuł:
- Minimizing makespan in general flow-shop scheduling problem using a GA-based improvement heuristic
- Autorzy:
- Semančo, P.
- Powiązania:
- https://bibliotekanauki.pl/articles/117960.pdf
- Data publikacji:
- 2011
- Wydawca:
- Polskie Towarzystwo Promocji Wiedzy
- Tematy:
-
flow-shop production
evolutionary algorithm - Opis:
- In the paper an improvement heuristic is proposed for permutation flow-shop problem based on the idea of evolutionary algorithm. The approach employs constructive heuristic that gives a good initial solution. GA-based improvement heuristic is applied in conjunction with three well-known constructive heuristics, namely CDS, Gupta’s algorithm and Palmer’s Slope Index. The approach is tested on benchmark set of 10 problems range from 4 to 25 jobs and 4 to 30 machines. The results are also compared to the best-known lower-bound solutions.
- Źródło:
-
Applied Computer Science; 2011, 7, 1; 57-64
1895-3735 - Pojawia się w:
- Applied Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł