Survey on Distributed Assembly Permutation Flowshop Scheduling Problem

As the rapid development of modern manufacturing, the past decades have witnessed a trend in which jobs are firstly processed in distributed production factories and then assembled into the final products in an assembly factory after completion. Such manufacturing mode brings many advantages as well as some new challenges on resource scheduling. This paper surveys literature on the distributed assembly permutation flowshop scheduling problem (DAPFSP). Firstly, the background and main issues in DAPFSP are introduced. Then, mathematical models, encoding and decoding schemes, and global and local search algorithms are thoroughly discussed for DAPFSP with the objective of minimizing the maximal completion time. Additionally, recent advances on DAPFSP with various objectives, such as total flow time, DAPFSP with other constraints like no-wait, and DAPFSP by taking issues including setup time into consideration are also surveyed. Finally, several future research directions worthy further investigation are pointed out. © 2024 Editorial Department of Scientia Agricultura Sinica. All rights reserved.