计算机工程与应用Issue(1)：255-259,5.DOI:10.3778/j.issn.1002-8331.1203-0816
动态子和声算法求解无等待批量流水线问题
Harmony search algorithm with dynamic sub-harmony memories for lot-streaming no-wait flowshop scheduling problem
摘要
Abstract
An enhanced harmony search algorithm is proposed to solve lot-streaming no-wait scheduling problem. An ini-tialization method based on the NEH(Nawaz-Enscore-Ham)heuristic and chaos is designed, and the job sequences and real-valued vector are interconverted. A local best harmony vector is used to produce a new individual. The algorithm may get trapped in a local optimum. To overcome this problem, a mutation scheme is applied to each harmony vector. Then, the harmony memory is dynamic divided into some small-sized sub-HM based on shuffled frog-leaping algorithm. Finally, to further enhance the exploitation capability and efficiency of the algorithm, a local search algorithm is embedded in the proposed harmony search algorithm. The computational results and comparisons show that the proposed algorithm is effec-tive and efficient in finding better solutions for the problem considered.关键词
和声搜索/批量/无等待流水线调度Key words
harmony search/lot-streaming/no-wait flow shop scheduling分类
信息技术与安全科学引用本文复制引用
潘玉霞,谢光,杨琳..动态子和声算法求解无等待批量流水线问题[J].计算机工程与应用,2014,(1):255-259,5.基金项目
三亚学院校级项目（No.XYQN12-9）。 （）
