期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 52, 期 19, 页码 5735-5747出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2014.910627
关键词
scheduling; reentrant hybrid flowshop; bi-objective; meta-heuristic
资金
- National Science Council of the Republic of China (Taiwan) [NSC 102-2221-E-027-056, NSC 101-2410-H-182-004-MY2]
The multi-objective reentrant hybrid flowshop scheduling problem (RHFSP) exhibits significance in many industrial applications, but appears under-studied in the literature. In this study, an iterated Pareto greedy (IPG) algorithm is proposed to solve a RHFSP with the bi-objective of minimising makespan and total tardiness. The performance of the proposed IPG algorithm is evaluated by comparing its solutions to existing meta-heuristic algorithms on the same benchmark problem set. Experimental results show that the proposed IPG algorithm significantly outperforms the best available algorithms in terms of the convergence to optimal solutions, the diversity of solutions and the dominance of solutions. The statistical analysis manifestly shows that the proposed IPG algorithm can serve as a new benchmark approach for future research on this extremely challenging scheduling problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据