Harmony Search Algorithms for Bi-criteria No-idle permutation Flow Shop Scheduling Problem

摘要：

Three hybrid harmony search (HS) algorithms are proposed for solving Bi-criteria No-idle permutation Flow Shop Scheduling Problem in this paper. Two objectives, i.e. the maximum completion time (makespan) and the total flow time (TFT), are considered simultaneously. The proposed algorithms firstly convert continuous harmony vectors into job permutations according to the largest position value (LPV) rule. Then the algorithms use the NEH algorithm to initialize one harmony and the others are initialized randomly. Lastly, a local search method is used in the proposed algorithms to enhance the exploitation capability. The extensive computational experiments demonstrate the high effectiveness and searching ability of the hybrid harmony algorithms especially the hybrid Globalbest harmony search (hGHS) algorithm.

关键词： Hybrid harmony search Multi-objective optimization Makespan Total flow time

作者: Wen-Juan REN Jun-Hua DUAN Hong-yan Han Feng-rong Zhang Min Zhang

作者单位: College of Computer Science, Liao Cheng University, CO 252059,China College of Mathematic, Liao Cheng University, CO 252059,China

会议类型: 国际会议

会议名称: 2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)

会议地点: 四川绵阳

会议语种:英文

页码: 2518-2522

在线出版日期: 2011-05-23（万方平台首次上网日期，不代表论文的发表时间）