批量流水线调度, 最大完成时间, 人工蜂群算法, 自适应策略, 路径链接

A discrete artificial bee colony(DABC) algorithm was presented for solving the lot-streaming flow shop scheduling problem(LFSP) with the objective of minimizing the maximum completion time, i.e., makespan. Two methods for calculating makespan, namely forward pass calculation and backward pass calculation were investigated respectively, and a speed-up approach to evaluate the whole insertion neighborhood was presented. Unlike the traditional ABC algorithm, in the proposed DABC algorithm, individuals were represented as discrete job permutations.An initialization taking advantage of an extended NEH(Nawaz-Enscore-Ham) heuristic was used to produce a population with certain diversity and quality.An adaptive strategy based on insert and swap operators and a path re-linking strategy were utilized to generate neighboring food sources.An effective local search based on insertion neighborhood was fused to enhance the algorithm's exploitation. At the same time, to maintain diversity of the population and avoid to trapping into a local optimum, a restart mechanism was performed when the similarity of the individuals in the population was larger than a given threshold value. Extensive experiments were provided and the comparisons show that the proposed DABC algorithm is effective and efficient for the LFSP.