Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Liu, Weilingc | Xu, Jinliangc | Ren, Guoqingc | Xiao, Yanjuna; b; c; *
Affiliations: [a] Tianjin Key Laboratory of Power Transmission and Safety Technology for New Energy Vehicles, School of Mechanical Engineering, Hebei University of Technology, Tianjin, China | [b] Career Leader Intelligent Control Automation Company, SuQian, Jiangsu Province, China | [c] School of Mechanical Engineering, Hebei University of Technology, Tianjin, China
Correspondence: [*] Corresponding author. Yanjun Xiao. E-mail: 1290766015@qq.com.
Abstract: 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.
Keywords: Fuzzy flexible job shop scheduling, PSO, QPSO, simulated annealing, local search
DOI: 10.3233/JIFS-231640
Journal: Journal of Intelligent & Fuzzy Systems, vol. 45, no. 3, pp. 4885-4905, 2023
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl