A hybrid particle swarm optimisation for multi-objective flexible job-shop scheduling problem with dual-resources constrained

Abstract

In this paper, a hybrid discrete particle swarm algorithm based on maximum fitness function is proposed for a dual-resources constrained flexible job shop scheduling problem with multiple optimisation objectives. An improved position updating mechanism of particles is used to effectively avoid the occurrence of infeasible solution. Additionally, a novel dynamic search strategy is designed to enhance the local exploiting search ability of discrete particle swarms. Finally, simulation results demonstrate that the proposed algorithm effectively decreases both the production time and production cost.