- Tytuł:
- A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
- Autorzy:
-
Chung, Chia-Shin
Flynn, James
Rom, Walter
Staliński, Piotr - Powiązania:
- https://bibliotekanauki.pl/articles/475000.pdf
- Data publikacji:
- 2012
- Wydawca:
- Fundacja Upowszechniająca Wiedzę i Naukę Cognitione
- Tematy:
-
genetic algorithm
scheduling
permutation flowshop
tardiness - Opis:
- The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA, which can handle problems with larger n. We also undertake a numerical study comparing GA with an optimal branch and bound algorithm, and various heuristic algorithms including the well known NEH algorithm and a local search heuristic LH. Extensive computational experiments indicate that LH is an effective heuristic and GA can produce noticeable improvements over LH.
- Źródło:
-
Journal of Entrepreneurship, Management and Innovation; 2012, 8, 2; 26-43
2299-7075
2299-7326 - Pojawia się w:
- Journal of Entrepreneurship, Management and Innovation
- Dostawca treści:
- Biblioteka Nauki
Artykuł