On performance analysis of hybrid algorithm (improved PSO with simulated annealing) with GA, PSO for multiprocessor job scheduling

Authors:
K. Thanushkodi;K. Deeba
Affiliations:
Akshaya College of Engineering, Anna University of Technology, Coimbatore, India;Department of Computer Science and Engineering, Kalignar Karunanidhi Institute of Technology, Anna University of Technology, Coimbatore, India
Venue:
WSEAS Transactions on Computers
Year:
2011

Citing 16
Cited 0

Scheduling independent tasks on uniform processors

SIAM Journal on Computing
Tighter bounds for LPT scheduling on uniform processors

SIAM Journal on Computing
List scheduling with and without communication delays

Parallel Computing
A comparison of list schedules for parallel processing systems

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Comparison between Genetic Algorithms and Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
A Hybrid Algorithm Based on Particle Swarm Optimization and Simulated Annealing for Job Shop Scheduling

ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 03
Introduction to Genetic Algorithms

Introduction to Genetic Algorithms
Parallel Simulated Annealing for the Job Shop Scheduling Problem

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems

Computers and Industrial Engineering
Letters: An improved PSO-based ANN with simulated annealing technique

Neurocomputing
Multiprocessor scheduling with interprocessor communication delays

Operations Research Letters
A note on LPT scheduling

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Particle Swarm Optimization is currently employed in several optimization and search problems due its ease and ability to find solutions successfully. A variant of PSO, called as Improved PSO has been developed in this paper and is hybridized with the simulated annealing approach to achieve better solutions. The hybrid technique has been employed, inorder to improve the performance of improved PSO. This paper shows the application of hybrid improved PSO in Scheduling multiprocessor tasks. A comparative performance study is reported. It is observed that the proposed hybrid approach gives better solution in solving multiprocessor job scheduling.