求解零空闲流水线调度问题的和声搜索算法

摘要

针对以总流经时间和最大完工时间为目标的零宅闲流水线调度问题,提出了和声搜索凋度算法.该算法利用和声搜索算法的优化机理,采用基于浮点数的编码方式和新设计的和声产生方法,扩展了传统和声搜索算法的求解模型,并结合快速插入邻域局部搜索算法,给出了三种混合求解策略.仿真试验表明,该算法具有高效性和优越性.%A new Harmony Search(HS) optimization algorithm was presented for solving the No-Idle Flow Shop scheduling(NIFS) problems with objectives of minimizing the total flowtime and makespan. Inthis algorithm, the Smallest Position Value(SPV) rule was applied to enable the continuous HS algorithm to be used in all kinds of sequencing problems, and the basic HS mechanism was expended to work more effectively. Then, an local search algorithm based on the speed-up technology for inserting neighborhood structure was presented. Finally, three hybrid algorithms are developed by combining the proposed HS and local search algorithms. Computational results showed the effectiveness and superiority of the proposed algorithms.