Integrated scheduling algorithm based on an operation relationship matrix table for tree-structured products

The processing and assembly of tree-structured products can be performed simultaneously, which leads to an integrated scheduling problem. To address this problem, we propose an integrated scheduling algorithm based on an operation relationship matrix table. The algorithm initially establishes an operation relationship matrix table. The improved genetic algorithm based on the table is subsequently adopted to solve this problem. To ensure that the initial population satisfies the sequence constraints, this algorithm uses a novel encoding method based on the dynamic operation relationship matrix table. In addition, corresponding new crossover and mutation methods are designed to ensure the feasibility of the generated offspring individuals. A simple decoding method based on the operation relationship matrix table is also presented. The feasibility and superiority of the proposed algorithm is demonstrated experimentally. Some existing algorithms have defects, such as scale limitation, indispensable repair process and incomplete encoding. However, the proposed algorithm not only overcomes such defects but also significantly reduces the complexity of addressing the problem, which can provide valuable references for solving similar problems.