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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call