RESEARCH ON JOB-SHOP SCHEDULING PROBLEM BASED ON IMPROVED PARTICLE SWARM OPTIMIZATION

Zufeng Zhong
2013 unpublished
Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It uses the maximum flow time which is minimized to evaluate the performance of the algorithm, and applies
more » ... it to solve a typical scheduling problem. A large number of simulation results show that this algorithm has good feasibility and effectiveness in job-shop scheduling problem.
fatcat:ctfwy62d6jeezloe2rscngfp24