Graph-based assembly sequence planning algorithm with feedback weights

Assembly sequence planning is one of the most important processes in mass production. However, this process is currently impeded by the lack of feedback for the next process how to plan an excellent assembly line. In this paper, we introduce the priority graph model, develop the subassembly recognition method, and design the selection algorithm with feedback weights for assembly line design in topological sequencing. We show that the method can quickly plan a satisfactory sequence compared to heuristic algorithms. Due to the different weights from assembly line designers, satisfactory assembly sequences with different adaptability can be planned. This work has implications for co-design of assembly sequence planning and assembly line design.