A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling<sup>*</sup>

邓冠龙; 徐震浩; 顾幸生

Your Location：

Home >

Browse articles >

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

Updated：2026-01-06

- A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling^*
- A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling^*
- 中国化学工程学报（英文版） 2012年20卷第6期页码：1067-1073
- Affiliations：
  
  Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology,Shanghai,China,200237
- Author bio：
- Funds：
  
  Supported by the National Natural Science Foundation of China (61174040;61104178);the Fundamental Research Funds for the Central Universities
- DOI：
  中图分类号：
- 纸质出版：2012
- Accepted：
Scan QR Code
邓冠龙, 徐震浩, 顾幸生. A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling^*[J]. 中国化学工程学报（英文版）, 2012,20(6):1067-1073.

[J]. Chinese Journal of Chemical Engineering, 2012, 20(6): 1067-1073.
邓冠龙, 徐震浩, 顾幸生. A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling^*[J]. 中国化学工程学报（英文版）, 2012,20(6):1067-1073. DOI：

[J]. Chinese Journal of Chemical Engineering, 2012, 20(6): 1067-1073. DOI：

摘要

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

references

浏览量

2125

Downloads

CSCD

文章被引用时，请邮件提醒。

Submit

工具集

关联资源

The melting transformation mechanism of corundum and mullite in coal ash under reducing atmosphere

Experimental and numerical studies of holdup and velocity behavior for inclined bubbly oil-water pipe flows

Controllable synthesis of Ni3S2/V3S4@NF-xF(x=0, 4, 8) catalysts for efficient hydrogen production in seawater and urea electrolyte

Dynamic behavior of a single bubble in cavity flow driven by a turbulent channel

Dual-site engineering of Ga-modified HZSM-5 towards efficient propane aromatization