IMPROVED PARTICLE SWARM ALGORITHM FOR PERMUTATION FLOW SHOP SCHEDULING PROBLEMS

Abstract

Particle Swarm Optimization PSO is one of the appropriate methods for solving NP-hard problems. So, improving PSO has sense. The permutation flow shop scheduling is one of these problems. In this paper, the permutation flow shop scheduling problems is solved by using improved particle swarm optimization named IPSO. The improvement is done by replacing the generated initial swarm by another one near to optimal solution by implementing the Individual improvement scheme IIS. The performance of IPSO is evaluated by several evaluation criteria and several problems generated randomly from uniform distribution and compered with PSO.The result shows that IPSO is outperform PSO.