Solving Job-Shop Scheduling Problem Using a Developed Particle Swarm Optimization Algorithm

This paper aims to provide an efficient optimization algorithm to solve the problem of job-shop scheduling. PSO has been widely studied in numerous applications for its worthy global searching ability. A new modified of particle swarm optimization algorithm is adopted, which is an extension of the standard particle swarm optimization algorithm (PSO) in order to get a better performance. The improvement technique used is the overcome of the idle particle position. The system used the developed PSO as a search method for an optimal schedule. The experimental results show that the developed PSO performs better than the original PSO.