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

dc.contributor.author	Davendra, Donald David
dc.contributor.author	Zelinka, Ivan
dc.contributor.author	Bialic-Davendra, Magdalena
dc.contributor.author	Šenkeřík, Roman
dc.contributor.author	Jašek, Roman
dc.date.accessioned	2012-11-02T13:23:02Z
dc.date.available	2012-11-02T13:23:02Z
dc.date.issued	2013
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.	cs
dc.description.firstpage	100	cs
dc.description.issue	1-2	cs
dc.description.lastpage	110	cs
dc.description.source	Web of Science	cs
dc.description.volume	57	cs
dc.identifier.citation	Mathematical and Computer Modelling. 2013, vol. 57, issues 1-2, p. 100-110.	cs
dc.identifier.doi	10.1016/j.mcm.2011.05.029
dc.identifier.issn	0895-7177
dc.identifier.location	Není ve fondu ÚK	cs
dc.identifier.uri	http://hdl.handle.net/10084/95670
dc.identifier.wos	000308805600011
dc.language.iso	en	cs
dc.publisher	Elsevier	cs
dc.relation.ispartofseries	Mathematical and Computer Modelling	cs
dc.relation.uri	http://dx.doi.org/10.1016/j.mcm.2011.05.029	cs
dc.subject	self-organising migrating algorithm	cs
dc.subject	flow shop	cs
dc.subject	scheduling	cs
dc.subject	no-wait	cs
dc.title	Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan	cs
dc.type	article	cs
dc.type.status	Peer-reviewed	cs

Files

Now showing 1 - 1 out of 1 results