A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem

被引：112

作者：

Shokrollahpour, E. ^{[1
]}

Zandieh, M. ^{[1
]}

Dorri, Behrouz ^{[1
]}

机构：

[1] Shahid Beheshti Univ, Dept Ind Management, Management & Accounting Fac, GC, Tehran, Iran

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2011年 / 49卷 / 11期

关键词：

assembly flowshop; bi-criteria scheduling; makespan; mean completion time; imperialist competitive algorithm; MINIMIZE; HEURISTICS; COMPLEXITY; MAKESPAN; SEARCH;

D O I：

10.1080/00207540903536155

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：3087 / 3103

页数：17

共 18 条

[1]

Al-Anzi F. S., 2006, International Journal of Operations Research, V3, P109

[2] Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan [J].