Performance of particle swarm optimization in scheduling hybrid flow-shops with multiprocessor tasks

Authors:
M. Fikret Ercan;Yu-Fai Fung
Affiliations:
School of Electrical and Electronic Engineering, Singapore Polytechnic, Singapore;Department of Electrical Engineering, Hong Kong Polytechnic University, Kowloon, Hong Kong, SAR
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Year:
2007

Citing 5
Cited 0

An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

IEEE Transactions on Computers
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling
Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many industrial and computing applications, proper scheduling of tasks can determine the overall efficiency of the system. The algorithm, presented in this paper, tackles the scheduling problem in a multi-layer multiprocessor environment, which exists in many computing and industrial applications. Based on the scheduling terminology, the problem can be defined as multiprocessor task scheduling in hybrid flow-shops. This paper presents a particle swarm optimization algorithm for the solution and reports its performance. The results are compared with other well known meta-heuristic techniques proposed for the solution of the same problem. Our results show that particle swarm optimization has merits in solving multiprocessor task scheduling in a hybrid flow-shop environment.