Hybrid Discrete Harmony Search Algorithm for Flow Shop Scheduling with Limited Buffers  

作　　者：崔喆 顾幸生 

机构地区：[1]Key Laboratory of Advanced Control and Optimization for Chemical Process,Ministry of Education,East China University of Scienceand Technology

出　　处：《Journal of Donghua University(English Edition)》2014年第2期171-178,共8页东华大学学报（英文版）

基　　金：National Natural Science Foundations of China(Nos.61174040,61104178);Shanghai Commission of Science and Technology,China(No.12JC1403400);the Fundamental Research Funds for the Central Universities,China

摘　　要：The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.The flow shop scheduling problem with limited buffers （ LBFSP） widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover, the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition. an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.

关 键 词：multiproduct processes scheduling problem limited buffers total flow time harmony search 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]