AN EVOLUTIONARY ALGORITHM FOR CONSTRAINT FLOW SHOPS WITH MULTI-CRITERIA OPTIMIZATION

摘要：

In this paper, an evolutionary algorithm is introduced for the NP-hard multi-criteria no-wait flow shop scheduling problems. Both makespan and total flowtime are taken into account. The proposed algorithm makes use of non-dominated sorting strategy. Corresponding objective increment properties are analyzed to improve efficiency for searching Pareto solutions. Experimental results show that the proposal outperforms the other three heuristics currently available.

关键词： Constraint Flowshop Objective Increment Makespan Total flowtime

作者: XIAO-PING LIAO JING DENG XIAO-PING LI

作者单位: College of Computer & Information Engineering, Hohai University, Nanjing 210098, China School of Computer Engineering, Nanjing Institute of Technology, Nanjing 211167, P.R.China School of Computer Science & Engineering, Southeast University, 210096, Nanjing, P.R.China

会议类型: 国际会议

会议名称: 2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

会议地点: 昆明

会议语种:英文

页码: 904-908

在线出版日期: 2008-07-12（万方平台首次上网日期，不代表论文的发表时间）