Kontaktujte nás | Jazyk: čeština English
dc.title | Scheduling flow shops with blocking using a discrete self-organising migrating algorithm | en |
dc.contributor.author | Davendra, Donald David | |
dc.contributor.author | Bialic-Davendra, Magdalena Lucyna | |
dc.relation.ispartof | International Journal of Production Research | |
dc.identifier.issn | 0020-7543 Scopus Sources, Sherpa/RoMEO, JCR | |
dc.date.issued | 2013 | |
utb.relation.volume | 51 | |
utb.relation.issue | 8 | |
dc.citation.spage | 2200 | |
dc.citation.epage | 2218 | |
dc.type | article | |
dc.language.iso | en | |
dc.publisher | Taylor and Francis | en |
dc.identifier.doi | 10.1080/00207543.2012.711968 | |
dc.relation.uri | http://www.tandfonline.com/doi/abs/10.1080/00207543.2012.711968 | |
dc.subject | flow shop scheduling | en |
dc.subject | flowshop with blocking | en |
dc.subject | heuristics | en |
dc.subject | operations research | en |
dc.description.abstract | 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. | en |
utb.faculty | Faculty of Management and Economics | |
dc.identifier.uri | http://hdl.handle.net/10563/1003160 | |
utb.identifier.obdid | 43869910 | |
utb.identifier.scopus | 2-s2.0-84874633560 | |
utb.identifier.wok | 000315460200001 | |
utb.identifier.coden | IJPRB | |
utb.source | j-scopus | |
dc.date.accessioned | 2013-03-17T11:41:45Z | |
dc.date.available | 2013-03-17T11:41:45Z | |
utb.contributor.internalauthor | Bialic-Davendra, Magdalena Lucyna |