关键词: 和声搜索, 批量, 无等待流水线调度

Abstract: An enhanced harmony search algorithm is proposed to solve lot-streaming no-wait scheduling problem. An initialization 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 effective and efficient in finding better solutions for the problem considered.