关键词: 零空闲流水线调度, 和声搜索算法, 总流经时间, 最大完工时间, 局部搜索

Abstract: A new harmony search optimization algorithm (HS) is presented for solving the no-idle flow shop scheduling (NIFS) problem with the objectives of minimizing the total flowtime and makespan, respectively. In the proposed algorithm, the smallest position value (SPV) rule is applied to enable the continuous harmony search algorithm to be used in all kinds of sequencing problems, and the basic harmony search mechanism is expended to work more effectively. Then an local search algorithm based on the speed-up technology for insert neighborhood structure is presented. Finally, three hybrid algorithms are developed by combining the proposed HS and local search algorithms. The computational results show the effectiveness and superiority of the proposed algorithms.

Key words: no-idle flow shop, harmony search, total flowtime, makespan, local search