Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 49, Issue 11, Pages 3087-3103Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540903536155
Keywords
assembly flowshop; bi-criteria scheduling; makespan; mean completion time; imperialist competitive algorithm
Ask authors/readers for more resources
This paper deals with the two-stage assembly flowshop scheduling problem with minimisation of weighted sum of makespan and mean completion time as the objective. The problem is NP-hard, hence we proposed a meta-heuristic named imperialist competitive algorithm (ICA) to solve it. Since appropriate design of the parameters has a significant impact on the algorithm efficiency, we calibrate the parameters of this algorithm using the Taguchi method. In comparison with the best algorithm proposed previously, the ICA indicates an improvement. The results have been confirmed statistically.
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