Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 51, Issue -, Pages 172-181Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2014.05.013
Keywords
Scheduling; Unrelated parallel machines; Setup times; Artificial bee colony; Metaheuristic
Categories
Funding
- National Science Council Taiwan [NSC NSC101-2410-H-182-004-MY2, NSC 102-2221-E-027-056]
Ask authors/readers for more resources
To date, the topic of unrelated parallel machine scheduling problems with machine-dependent and job sequence-dependent setup times has received relatively little research attention. In this study, a hybrid artificial bee colony (HABC) algorithm is presented to solve this problem with the objective of minimizing the makespan. The performance of the proposed HABC algorithm was evaluated by comparing its solutions to state-of-the-art metaheuristic algorithms and a high performing artificial bee colony (ABC)-based algorithm. Extensive computational results indicate that the proposed HABC algorithm significantly outperforms these best-so-far algorithms. Since the problem addressed in this study is a core topic for numerous industrial applications, this article may help to reduce the gap between theoretical progress and industrial practice. (C) 2014 Elsevier Ltd. 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