An Immune-PSO algorithm for bi-objective flow shop scheduling problem

An Immune-PSO (BIPSO) algorithm introducing the artificial immune system is proposed for the permutation flow shop scheduling problem with average through time and makespan criterions .In the basis of PSO algorithm, the new algorithm uses dynamic fitness to evaluates particles, improves the inertial factor and compensates the shortcoming of easily falling into the local optimum of the PSO with the advantage of maintaining the diversity of the population of immune algorithm . The simulation results shows that the new method has better performances in the convergence rate and solution quality.