Hybrid Tabu Search algorithm for bi-criteria No-idle permutation Flow Shop Scheduling Problem

摘要：

A novel Hybrid Tabu Search Algorithm (HTS) is 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 at the same time. The initial solution of the Tabu Search Algorithm is generated by the famous NEH heuristic. A speed-up method is introduced both in NEH and HTS to improve the efficiency of the algorithm. Then the dynamic feature of the tabu list length is applied to improve the robustness of the algorithm. And a local search method is embedded in the HTS to improve the exploitation capability of the algorithm. It is proved by the extensive computational experiments that the HTS algorithm is superior to the existing algorithms both in computing effectiveness and searching ability.

关键词： No-idle permutation Flow Shop Scheduling Makespan Total flow time Tabu Search Algorithm Multi-objective optimization

作者: Wen-Juan REN Jun-Hua DUAN Feng-rong Zhang Hong-yan Han 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)

会议地点: 四川绵阳

会议语种:英文

页码: 1699-1702

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