Two-stage iterated greedy algorithm for distributed flexible assembly permutation flowshop scheduling problems with sequence-dependent setup times

• Published in: AIMS mathematics Vol. 10; no. 5; pp. 11488 - 11513
• Main Authors: Li, Yuan-Zhen, Meng, Lei-Lei, Zhang, Biao
• Format: Journal Article
• Language: English
• Published: AIMS Press 01.01.2025
• Subjects: distributed permutation flowshop scheduling; flexible assembly; makespan; optimization; sequence-dependent setup times; two-stage iterated greedy algorithm
• ISSN: 2473-6988; 2473-6988
• DOI: 10.3934/math.2025523

In this study, the distributed flexible assembly permutation flowshop scheduling problem (DFAPFSP) with sequence-dependent setup times and makespan criterion was investigated. The DFAPFSP comprises two distinct phases: a distributed permutation flowshop in the initial stage, followed by an integration phase. The integration stage, which employs multiple parallel assembly machines, achieves significantly higher throughput efficiency compared to monolithic assembly machine architectures in high-volume manufacturing scenarios. A novel mixed-integer linear programming model was established to describe the problem. The DFAPFSP can be divided into two stages: production and assembly. A two-stage iterated greedy (TSIG) algorithm was designed based on the two-stage characteristics of the DFAPFSP. In the first stage, the production plan is optimized, and in the second stage, the assembly plan is optimized. The destruction, reconstruction, and local search algorithms in the two stages and acceptance criterion were redesigned. Numerous computational experiments and performance evaluations were performed by comparing the TSIG algorithm with state-of-the-art algorithms. The results and discussions show that the proposed TSIG algorithm is better than its peers for solving the DFAPFSP.