An improved Particle Swarm Optimization algorithm and its application to a class of JSP problem

In this paper, we analyze the special job shop scheduling problem (JSP) of actual production system in large-scale structure workshops. With regard to this kind of JSP problem, two novel mathematical models (deterministic model and stochastic model) are proposed. In addition, particle swarm optimization (PSO) algorithm is used in the paper because of its high efficiency, and binary PSO algorithm is improved for solving this special scheduling problem, i.e. how to arrange m workers to process n jobs. The results obtained from the simulation study demonstrate that using this heuristics method to solve mathematical models can reach optimal or near-optimal solutions efficiently, and can be widely used in many actual manufactories´ workshops.