Job Shop Scheduling based on Improved Discrete Particle Swarm Optimization

Based on the basic particle swarm optimization algorithm and the analysis of the basic principles of job shop scheduling problem, an improved discrete particle swarm optimization (IDPSO) is proposed in the paper. In the IDPSO, the discrete particle location is updated by the operation of mutation and crossover based on the evolutionary mechanism of PSO, and a neighbourhood algorithm is introduced to enhance the ability of local search. Finally a simulation results of an example proved the feasibility and validity of the algorithm.