Show simple item record

dc.contributor.authorDavendra, Donald David
dc.contributor.authorZelinka, Ivan
dc.contributor.authorBialic-Davendra, Magdalena
dc.contributor.authorŠenkeřík, Roman
dc.contributor.authorJašek, Roman
dc.date.accessioned2012-11-02T13:23:02Z
dc.date.available2012-11-02T13:23:02Z
dc.date.issued2013
dc.identifier.citationMathematical and Computer Modelling. 2013, vol. 57, issues 1-2, p. 100-110.cs
dc.identifier.issn0895-7177
dc.identifier.urihttp://hdl.handle.net/10084/95670
dc.description.abstractThis 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.language.isoencs
dc.publisherElseviercs
dc.relation.ispartofseriesMathematical and Computer Modellingcs
dc.relation.urihttp://dx.doi.org/10.1016/j.mcm.2011.05.029cs
dc.subjectself-organising migrating algorithmcs
dc.subjectflow shopcs
dc.subjectschedulingcs
dc.subjectno-waitcs
dc.titleDiscrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespancs
dc.typearticlecs
dc.identifier.locationNení ve fondu ÚKcs
dc.identifier.doi10.1016/j.mcm.2011.05.029
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume57cs
dc.description.issue1-2cs
dc.description.lastpage110cs
dc.description.firstpage100cs
dc.identifier.wos000308805600011


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record