会议专题

HYBRID GENETIC-VNS ALGORITHM WITH TOTAL FLOWT1ME MINIMIZATION FOR THE NO-WAIT FLOWSHOP PROBLEM

In this paper, a hybrid Genetic-VNS algorithm is proposed for the no-wait flowshop problem with total flowtime minimization. To avoid pitfalls of GA, such as poor local search capability and premature convergence, a rather effective VNS local search is introduced based on the framework of the improved GA. To fast convergence of the algorithm, ICH2 (an efficient composite heuristic) is used for the initial population generation. Experimental results show that the proposed algorithm outperforms other best two recent existing methods on both small and large instances.

Hybrid Genetic-VNS algorithm no-wait flowshop total flowtime scheduling

NING YANG XIAO-PING LI JIE ZHU QIAN WANG

School of Computer Science and Engineering, Southeast University, Nanjing, P.R.China Key Laboratory of Computer Network and Information Integration Ministry of Education, Southeast University, Nanjing, P.R.China

国际会议

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

昆明

英文

935-940

2008-07-12(万方平台首次上网日期,不代表论文的发表时间)