A Novel Discrete Harmony Search Algorithm for Scheduling Lot-streaming Flow Shops
This paper proposes a novel discrete harmony search (DHS) algorithm to minimize makespan for a lot-streaming flow shop scheduling problem with sequence dependent setup times. Unlike the traditional harmony search (HS) algorithm, the proposed DHS algorithm utilizes job permutations to represent harmonies and applies a job-permutation-based improvisation to generate new harmonies. To enhance the algorithm’s searching ability, an effective initialization scheme based on the NEH heuristic is developed to construct an initial harmony memory with certain quality and diversity, and an efficient local search algorithm based on the insert neighborhood structures is fused to stress the local exploitation. Extensive computational simulations and comparisons are provided, which demonstrate the effectiveness of the proposed DHS against the best performing algorithms from the literature.
Flow shop scheduling Lot-streaming Harmony search algorithm Makespan
Quan-Ke Pan Jun-hua Duan J. J. Liang Kaizhou Gao Junqing Li
College of Computer Science, Liaocheng University, Liaocheng, 252059, PR China School. Electrical Engineering, Zhengzhou University
国际会议
The 22nd China Control and Decision Conference(2010年中国控制与决策会议)
徐州
英文
1531-1536
2010-05-26（万方平台首次上网日期，不代表论文的发表时间）