Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 264, Issue 1, Pages 66-73Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2017.06.027
Keywords
Scheduling; Migrating birds optimization; Permutation flowshop; Makespan; Sequence dependent setup times
Funding
- CRSNG (CANADA)
Ask authors/readers for more resources
This paper presents an enhanced migrating bird optimization (MBO) algorithm and a new heuristic for solving a scheduling problem. The proposed approaches are applied to a permutation flowshop with sequence dependent setup times and the objective of minimizing the makespan. In order to augment the MBOs intensification capacity, an original problem specific heuristic is introduced. An adapted neighborhood, a tabu list, a restart mechanism and an original process for selecting a new leader also improved the MBO's behavior. Using benchmarks from the literature, the resulting enhanced MBO (EMBO) gives state-of-the-art results when compared with other algorithms reference. A statistical analysis of the numerical experiments confirms the relative efficiency and effectiveness of both EMBO and the new heuristic. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available