摘要:
针对以最大完工时间为目标的批量流水线调度问题,提出一种改进的和声搜索优化算法。该算法采用ROV规则的编码方式,使具有连续本质的和声搜索算法能直接应用于调度问题。对和声库的初始化和候选解的产生方式进行改进。针对该算法容易陷入局部最优的缺陷,将其与阈值接受算法结合,得到2种混合算法。仿真结果证明了该算法的有效性。
关键词:
批量流水线调度问题,
和声搜索算法,
阈值接受算法
Abstract:
An Improved Harmony Search(NIHS) algorithm is presented for Lot-streaming Flow shop Scheduling Problem(LFSP) with objectives of makespan. Ranked-Order-Value(ROV) is applied to enable the continuous harmony search algorithm to be applied to scheduling problem. The initial harmony memory and the method of generating candidate solution is improved. Aiming at the shortcoming of premature and poor resulted from pure NIHS, two hybrid algorithms are put forward by combining NIHS and Threshold Accepting(TA). Simulation results show the effectiveness of the algorithm.
Key words:
Lot-streaming Flow shop Schedule Problem(LFSP),
Harmony Search(HS) algorithm,
Threshold Accepting(TA) algorithm
中图分类号:
韩红燕, 潘全科. 求解批量流水线调度问题的改进和声搜索算法[J]. 计算机工程, 2011, 37(6): 178-180.
HAN Gong-Yan, BO Quan-Ke. Improved Harmony Search Algorithm for Lot-streaming Flow Shop Schedule Problem[J]. Computer Engineering, 2011, 37(6): 178-180.