Kontaktujte nás | Jazyk: čeština English
Název: | Scheduling flow shops with blocking using a discrete self-organising migrating algorithm | ||||||||||
Autor: | Davendra, Donald David; Bialic-Davendra, Magdalena Lucyna | ||||||||||
Typ dokumentu: | Recenzovaný odborný článek (English) | ||||||||||
Zdrojový dok.: | International Journal of Production Research. 2013, vol. 51, issue 8, p. 2200-2218 | ||||||||||
ISSN: | 0020-7543 (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
DOI: | https://doi.org/10.1080/00207543.2012.711968 | ||||||||||
Abstrakt: | A novel approach of a discrete self-organising migrating algorithm is introduced to solve the flowshop with blocking scheduling problem. New sampling routines have been developed that propagate the space between solutions in order to drive the algorithm. The two benchmark problem sets of Carlier, Heller, Reeves and Taillard are solved using the new algorithm. The algorithm compares favourably with the published algorithms Differential Evolution, Tabu Search, Genetic Algorithms and their hybrid variants. A number of new upper bounds are obtained for the Taillard problem sets. © 2013 Taylor & Francis Group, LLC. | ||||||||||
Plný text: | http://www.tandfonline.com/doi/abs/10.1080/00207543.2012.711968 | ||||||||||
Zobrazit celý záznam |