Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning

Authors:
Shih-Wei Lin;Kuo-Ching Ying;Chien-Yi Huang
Affiliations:
Department of Information Management, Chang Gung University, Taoyan, Taiwan;Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan;Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan
Venue:
Computers and Operations Research
Year:
2013

Citing 10
Cited 0

Scheduling multiprocessor tasks in a two-stage flow-shop environment

Proceedings of the 21st international conference on Computers and industrial engineering
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
A new approach to solve hybrid flow shop scheduling problems by artificial immune system

Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
Bee colony optimization for the p-center problem

Computers and Operations Research
Solving reliability redundancy allocation problems using an artificial bee colony algorithm

Computers and Operations Research
A modified artificial bee colony algorithm

Computers and Operations Research
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal
A Bee Colony based optimization approach for simultaneous job scheduling and data replication in grid environments

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, the problem of scheduling multistage hybrid flowshops with multiprocessor tasks is contemplated. This is a strongly NP-hard problem for which a hybrid artificial bee colony (HABC) algorithm with bi-directional planning is developed to minimize makespan. To validate the effectiveness of the proposed algorithm, computational experiments were tested on two well-known benchmark problem sets. The computational evaluations manifestly support the high performance of the proposed HABC against the best-so-far algorithms applied in the literature for the same benchmark problem sets.