A performance comparison of PSO and GA in scheduling hybrid flow-shops with multiprocessor tasks

Authors:
M Fikret Ercan
Affiliations:
Singapore Polytechnic, Singapore
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 3
Cited 2

An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

IEEE Transactions on Computers
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling

Fuzzy swarm diversity hybrid model for text summarization

Information Processing and Management: an International Journal
A hybrid approach for learning concept hierarchy from Malay text using artificial immune network

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Applications in industry and computing require a proper scheduling of tasks to achieve good performance. The algorithms presented in this paper tackles task scheduling problem in a multi layer multiprocessor environment. Using the scheduling terminology, problem is defined as multiprocessor task scheduling in hybrid flow-shops. This paper presents a particle swarm optimization (PSO) algorithm for the solution. In order to improve the performance of PSO, hybrid techniques were also employed. The performance results, compared with other well known meta-heuristics from the literature, are reported. Results show that PSO and hybrid methods have merits in solving multiprocessor task scheduling in hybrid flow-shop environment.