| 一种求解阻塞型流水车间调度的离散人工蜂群算法(英文) |
| |
| 引用本文： | 邓冠龙,徐震浩,顾幸生.一种求解阻塞型流水车间调度的离散人工蜂群算法(英文)[J].中国化学工程学报,2012,20(6):1067-1073. |
| |
| 作者姓名： | 邓冠龙 徐震浩 顾幸生 |
| |
| 作者单位： | Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China (61174040, 61104178);the Fundamental Research Funds for the Central Universities |
| |
| 摘 要： | 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-05-21 |
A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling* |
| |
| DENG Guanlong, XU Zhenhao and GU Xingsheng.A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling*[J].Chinese Journal of Chemical Engineering,2012,20(6):1067-1073. |
| |
| Authors: | DENG Guanlong XU Zhenhao and GU Xingsheng |
| |
| Affiliation: | Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 CNKI ScienceDirect 等数据库收录！ |
| 点击此处可从《中国化学工程学报》浏览原始摘要信息 |
|
点击此处可从《中国化学工程学报》下载全文 |
