论文部分内容阅读
The flow shop scheduling problem with limited buffers is widely existing in manufacturing systems.This article proposes a hybrid discrete harmony search algorithm for the problem to minimize total flow time.The algorithm presents a novel discrete improvisation and a differential evolution scheme with the job-permutation-based representation.Moreover,the discrete harmony search is hybridized with the problemdependent 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 algorithmin terms of effectiveness and efficiency.