An improved quantum particle swarm algorithm for solving multi-objective fuzzy flexible job shop scheduling problem

• Published in: Journal of intelligent & fuzzy systems Vol. 45; no. 3; pp. 4885 - 4905
• Main Authors: Liu, Weiling, Xu, Jinliang, Ren, Guoqing, Xiao, Yanjun
• Format: Journal Article
• Language: English
• Published: London Sage Publications Ltd 24.08.2023
• Subjects: Algorithms; Completion time; Energy consumption; Job shop scheduling; Job shops; Optimization models; Parameter uncertainty; Production costs; Production scheduling; Scheduling; Search methods; Simulated annealing
• ISSN: 1064-1246; 1875-8967
• DOI: 10.3233/JIFS-231640

Due to the dynamic nature of work conditions in the manufacturing plant, it is difficult to obtain accurate information on process processing time and energy consumption, affecting the implementation of scheduling solutions. The fuzzy flexible job shop scheduling problem with uncertain production parameters has not yet been well studied. In this paper, a scheduling optimization model with the objectives of maximum completion time, production cost and delivery satisfaction loss is developed using fuzzy triangular numbers to characterize the time parameters, and an improved quantum particle swarm algorithm is proposed to solve it. The innovations of this paper lie in designing a neighborhood search strategy based on machine code variation for deep search; using cross-maintaining the diversity of elite individuals, and combining it with a simulated annealing strategy for local search. Based on giving full play to the global search capability of the quantum particle swarm algorithm, the comprehensive search capability of the algorithm is enhanced by improving the average optimal position of particles. In addition, a gray target decision model is introduced to make the optimal decision on the scheduling scheme by comprehensively considering the fuzzy production cost. Finally, simulation experiments are conducted for test and engineering cases and compared with various advanced algorithms. The experimental results show that the proposed algorithm significantly outperforms the compared ones regarding convergence speed and precision in optimal-searching. The method provides a more reliable solution to the problem and has some application value.