Deadlocks Solving Strategies in Hybrid PSO Algorithm for JSSP

PSO algorithm is widely used in solving combinatorial optimization problems. Deadlocks, one of the primary problems for JSSPs (job shop scheduling problem), need to be considered first while using PSO algorithm to solve JSSPs. To obtain effective hybrid PSO algorithm for JSSP, the reason creating deadlock problems in hybrid PSO algorithm based on exchange factor and exchange list is studied and three effective strategies for deadlocks are proposed in this paper. We compare and analyze the performance of three strategies by the experimental results for 13 benchmark problems.