This paper presents a swarm-based neighbourhood search algorithm(SNS) to minimize the maximum completion time of fuzzy job shop scheduling problem(FJSSP).SNS uses an ordered operation-based representation
tournament selection and swap operation in which probability is 1 and swap-time is adjusted dynamically.The theoretical analyses on scheduling results show that fuzzy makespan can be used to evaluate the quality of solution.Theoretical analysis and a large number of experiments demonstrate that SNS has strong global and local optimization capabilities
京公网安备11010802024621