文献类型：期刊文献

中文题名：A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling

英文题名：一种求解阻塞型流水车间调度的离散人工蜂群算法(英文)

作者：邓冠龙[1];徐震浩[1];顾幸生[1]

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

年份：2012

卷号：20

期号：6

起止页码：1067

中文期刊名：Chinese Journal of Chemical Engineering

外文期刊名：中国化学工程学报（英文版）

收录：CSTPCD;;Scopus;CSCD:【CSCD2011_2012】；

基金：Supported by the National Natural Science Foundation of China (61174040, 61104178);the Fundamental Research Funds for the Central Universities

语种：中文

中文关键词：blocking flow shop scheduling; artificial bee colony algorithm; total flow time

外文关键词：流水车间调度;时间标准;群算法;总流量;工蜂;离散;最小化;车间调度问题

摘要：A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH （Nawaz-Enscore-Ham） heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.