AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

A Q-Learning Improved Particle Swarm Optimization for Aircraft Pulsating Assembly Line Scheduling Problem Considering Skilled Operator Allocation

Xiaoyu Wen1,2Haohao Liu1,2Xinyu Zhang1,2Haoqi Wang1,2Yuyan Zhang1,2Guoyong Ye1,2Hongwen Xing3Siren Liu3Hao Li1,2( )
Henan Provincial Key Laboratory of Intelligent Manufacturing of Mechanical Equipment, Zhengzhou University of Light Industry, Zhengzhou, 450000, China
School of Mechanical and Electrical Engineering, Zhengzhou University of Light Industry, Zhengzhou, 450000, China
COMAC Shanghai Aircraft Manufacturing Co., Ltd., Shanghai, 200000, China
Show Author Information

Abstract

Aircraft assembly is characterized by stringent precedence constraints, limited resource availability, spatial restrictions, and a high degree of manual intervention. These factors lead to considerable variability in operator workloads and significantly increase the complexity of scheduling. To address this challenge, this study investigates the Aircraft Pulsating Assembly Line Scheduling Problem (APALSP) under skilled operator allocation, with the objective of minimizing assembly completion time. A mathematical model considering skilled operator allocation is developed, and a Q-Learning improved Particle Swarm Optimization algorithm (QLPSO) is proposed. In the algorithm design, a reverse scheduling strategy is adopted to effectively manage large-scale precedence constraints. Moreover, a reverse sequence encoding method is introduced to generate operation sequences, while a time decoding mechanism is employed to determine completion times. The problem is further reformulated as a Markov Decision Process (MDP) with explicitly defined state and action spaces. Within QLPSO, the Q-learning mechanism adaptively adjusts inertia weights and learning factors, thereby achieving a balance between exploration capability and convergence performance. To validate the effectiveness of the proposed approach, extensive computational experiments are conducted on benchmark instances of different scales, including small, medium, large, and ultra-large cases. The results demonstrate that QLPSO consistently delivers stable and high-quality solutions across all scenarios. In ultra-large-scale instances, it improves the best solution by 25.2% compared with the Genetic Algorithm (GA) and enhances the average solution by 16.9% over the Q-learning algorithm, showing clear advantages over the comparative methods. These findings not only confirm the effectiveness of the proposed algorithm but also provide valuable theoretical references and practical guidance for the intelligent scheduling optimization of aircraft pulsating assembly lines.

References

【1】
【1】
 
 
Computers, Materials & Continua
Pages 1-27

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Wen X, Liu H, Zhang X, et al. A Q-Learning Improved Particle Swarm Optimization for Aircraft Pulsating Assembly Line Scheduling Problem Considering Skilled Operator Allocation. Computers, Materials & Continua, 2026, 86(1): 1-27. https://doi.org/10.32604/cmc.2025.069492

6

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 24 June 2025
Accepted: 04 September 2025
Published: 10 November 2025
© The Author 2025.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.