| Article ID: | iaor20125756 |
| Volume: | 57 |
| Issue: | 1-2 |
| Start Page Number: | 100 |
| End Page Number: | 110 |
| Publication Date: | Jan 2013 |
| Journal: | Mathematical and Computer Modelling |
| Authors: | Davendra Donald, Zelinka Ivan, Bialic-Davendra Magdalena, Senkerik Roman, Jasek Roman |
| Keywords: | combinatorial optimization, heuristics |
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.