A discrete artificial bee colony algorithm for the blocking flow shop scheduling problem

Author

Deng, Guanlong ; Cui, Zhe ; Gu, Xingsheng

Author_Institution

Key Lab. of Adv. Control & Optimization for Chem. Process, East China Univ. of Sci. & Technol., Shanghai, China

fYear

2012

fDate

6-8 July 2012

Firstpage

518

Lastpage

522

Abstract

This paper presents a discrete bee colony algorithm for solving the blocking flow shop scheduling problem with makespan criterion. Based on the idea of iterated greedy algorithm, some new schemes for employed bee, onlooker bee and scout bee are designed. The performance of the proposed algorithm is tested on the well-known benchmark set of Taillard, and the computational results validate the effectiveness of the discrete bee colony algorithm in comparison with two recently proposed state-of-the-art algorithms. In addition, some new best known solutions for the benchmark set are provided for the considered problem.

Keywords

benchmark testing; flow shop scheduling; greedy algorithms; particle swarm optimisation; Taillard; benchmark set; blocking flow shop scheduling problem; discrete artificial bee colony algorithm; discrete bee colony algorithm; employed bee; iterated greedy algorithm; makespan criterion; onlooker bee; scout bee; Algorithm design and analysis; Benchmark testing; Job shop scheduling; Optimization; Sociology; Statistics; Flow shop scheduling; artificial bee colony algorithm; blocking; makespan;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation (WCICA), 2012 10th World Congress on

Conference_Location

Beijing

Print_ISBN

978-1-4673-1397-1

Type

conf

DOI

10.1109/WCICA.2012.6357934

Filename

6357934