A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling Problem
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 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 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.
Flow shop scheduling Blocking Artificial bee colony algorithm Total flow time
Guanlong Deng Zhenhao Xu Xingsheng Gu
Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, Eas Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, Eas
国内会议
厦门
英文
1-7
2012-08-01（万方平台首次上网日期，不代表论文的发表时间）