Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan

Davendra, Donald David; Zelinka, Ivan; Bialic-Davendra, Magdalena Lucyna; Šenkeřík, Roman; Jašek, Roman

dc.title	Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan	en
dc.contributor.author	Davendra, Donald David
dc.contributor.author	Zelinka, Ivan
dc.contributor.author	Bialic-Davendra, Magdalena Lucyna
dc.contributor.author	Šenkeřík, Roman
dc.contributor.author	Jašek, Roman
dc.relation.ispartof	Mathematical and Computer Modelling
dc.identifier.issn	0895-7177 Scopus Sources, Sherpa/RoMEO, JCR
dc.date.issued	2013
utb.relation.volume	57
utb.relation.issue	1-2
dc.citation.spage	100
dc.citation.epage	110
dc.type	article
dc.language.iso	en
dc.publisher	Pergamon Elsevier Science Ltd.	en
dc.identifier.doi	10.1016/j.mcm.2011.05.029
dc.relation.uri	https://www.sciencedirect.com/science/article/pii/S0895717711002998
dc.subject	Flow shop	en
dc.subject	No-wait	en
dc.subject	Scheduling	en
dc.subject	Self-Organising Migrating Algorithm	en
dc.description.abstract	This paper introduces a novel Discrete Self-Organising Migrating Algorithm for the task of flow-shop scheduling with no-wait makespan. The new algorithm is tested with the small and medium Taillard benchmark problems and the obtained results are competitive with the best performing heuristics in the literature.	en
utb.faculty	Faculty of Applied Informatics
dc.identifier.uri	http://hdl.handle.net/10563/1002947
utb.identifier.obdid	43868745
utb.identifier.scopus	2-s2.0-84866158637
utb.identifier.wok	000308805600011
utb.identifier.coden	MCMOE
utb.source	j-scopus
dc.date.accessioned	2012-10-04T12:11:47Z
dc.date.available	2012-10-04T12:11:47Z
utb.contributor.internalauthor	Bialic-Davendra, Magdalena Lucyna
utb.contributor.internalauthor	Šenkeřík, Roman
utb.contributor.internalauthor	Jašek, Roman