dc.contributor.author | Chung, Chia-Shin | |
dc.contributor.author | Flynn, James | |
dc.contributor.author | Rom, Walter | |
dc.contributor.author | Staliński, Piotr | |
dc.date.accessioned | 2018-01-22T16:46:39Z | |
dc.date.available | 2018-01-22T16:46:39Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Chung, Ch., Flynn, J., Walter, R., Staliński, P., A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems. Journal of Entrepreneurship, Management and Innovation (JEMI), 2012, vol. 8, nr 2 : Contemporary Management Concepts. Ed. by P. Staliński, s. 26-43 | en |
dc.identifier.issn | 2299-7326 | |
dc.identifier.uri | https://depot.ceon.pl/handle/123456789/14247 | |
dc.description.abstract | 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. | en |
dc.language.iso | en | |
dc.publisher | Wyższa Szkoła Biznesu - National Louis Univeristy | en |
dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Na tych samych warunkach 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/pl/ | * |
dc.subject | genetic algorithm | en |
dc.subject | scheduling | en |
dc.subject | permutation flowshop | en |
dc.subject | tardiness | en |
dc.title | A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems | pl |
dc.type | article | en |