文献类型：会议论文

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

作者：Deng Guanlong[1];Xu Zhenhao[1];Gu Xingsheng[1]

机构：[1]E China Univ Sci & Technol, Minist Educ, Key Lab Adv Control & Optimizat Chem Proc, Shanghai 200237, Peoples R China

会议论文集：23rd Chinese Process Control Conference (CPCC)

会议日期：AUG 11-12, 2012

会议地点：Xiamen, PEOPLES R CHINA

语种：英文

外文关键词：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.