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

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.