A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling

作者：Deng Guanlong; Xu Zhenhao; Gu Xingsheng^*

来源：Chinese Journal of Chemical Engineering, 2012, 20(6): 1067-1073.

DOI：10.1016/S1004-9541(12)60588-6

• 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.

• 出版日期2012-12
• 单位华东理工大学