Minimizing the total flowtime flowshop with blocking using a discrete artificial bee colony

Authors:
Yu-Yan Han;Jun-Hua Duan;Yu-Jie Yang;Min Zhang;Bao Yun
Affiliations:
School of Computer Science, Liaocheng University, China;School of Computer Science, Liaocheng University, China;Network Center, Liaocheng University, China;School of Computer Science, Liaocheng University, China;School of Computer Science, Liaocheng University, China
Venue:
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Year:
2011

Citing 5
Cited 0

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Computers and Industrial Engineering
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms

Expert Systems with Applications: An International Journal
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a discrete artificial bee colony (DABC) algorithm for the blocking flow shop (BFS) scheduling problem to minimize total flowtime. The DABC algorithm utilizes discrete job permutations to represent food sources and applies discrete operators to generate new food sources for the employed bees, onlookers and scouts. First, an initialization scheme based on MME (combination of MinMax and NEH) heuristic is presented to construct an initial population with a certain level of quality and diversity. Second, a local search based on the insertion neighborhood is applied to onlooker stage to improve the algorithm's local exploitation ability. Third, a destruction-construction operator is employed to obtain solutions for the scout bees. Computational simulations and comparisons show that the proposed algorithm (DABC) is effective and efficient for the blocking flow shop scheduling problems with total flowtime criterion.