摘要

This paper considered fuzzy flexible job scheduling problems with makespan and maximum machine workload and proposed a multi-objective swarm-based neighborhood search (MOSNS). In MOSNS, ordered operation-based doublet string and three-dimension array are used to indicate the solution of two subproblems, two swaps and an insertion are applied to produce new solutions, simple weighted objective-based methods are used to update swarm and external archive to obtain a set of nondominated solutions. Some numerical experiments are conducted by using some instances and computational results show that MOSNS performs better than the existing methods from literature.