Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
Loading...
Downloads
0
Date issued
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Location
Není ve fondu ÚK
Signature
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.
Description
Subject(s)
self-organising migrating algorithm, flow shop, scheduling, no-wait
Citation
Mathematical and Computer Modelling. 2013, vol. 57, issues 1-2, p. 100-110.