Integrated Scheduling Algorithm Based on the Improved Floyd Algorithm

In the research and practice of integrated scheduling problems, the tree structure of complex products usually presents an asymmetric and complex form. This asymmetry is mainly reflected in the hierarchical relationship between the various components of the product, the degree of dependence, and the sequence of production processes. Existing studies often neglect that leaf nodes with the lowest layer priority can be scheduled at any moment, leading to underutilization of parallelism potential under symmetric structures and exacerbation of critical path delays under asymmetric structures. Aiming at solving this kind of problem, an integrated scheduling algorithm based on the improved Floyd algorithm (ISA-IFA) is proposed. According to the improved Floyd algorithm, the algorithm proposed a path-weighted strategy, which constructs the vertical path value according to the processing time of the process itself. Combined with the proposed process scheduling advantage strategy, the leaf node process is especially emphasized as the priority scheduling object, which makes the connection between the processes more closely, and then significantly reduces the idle time of the equipment. The empirical results show that the ISA-IFA algorithm shortens the completion time of complex products and simultaneously improves the equipment utilization rate to 55.9%, verifying its effectiveness in dynamic scheduling and resource co-optimization.