Multiprocessor task scheduling problem using hybrid discrete particle swarm optimization |
| |
Authors: | T Vairam S Sarathambekai K Umamaheswari |
| |
Affiliation: | 1.Department of Information Technology,PSG College of Technology,Coimbatore,India |
| |
Abstract: | Task Scheduling is a complex combinatorial optimization problem and known to be an NP hard. It is an important challenging issue in multiprocessor computing systems. Discrete Particle Swarm Optimization (DPSO) is a newly developed swarm intelligence technique for solving discrete optimization problems efficiently. In DPSO, each particle should limit its communication with the previous best solution and the best solutions of its neighbors. This learning restriction may reduce the diversity of the algorithm and also the possibility of occurring premature convergence problem. In order to address these issues, the proposed work presents a hybrid version of DPSO which is a combination of DPSO and Cyber Swarm Algorithm (CSA). The efficiency of the proposed algorithm is evaluated based on a set of benchmark instances and the performance criteria such as makespan, mean flow time and reliability cost. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|