Integrated Scheduling Algorithm for No-Wait Network Flexible Based on Idle-Time Optimization and Process Rescheduling

To address the integrated scheduling problem involving no-wait constraints between processes in the actual production of complex products with both symmetric and asymmetric branches, and the need for cross-workshop equipment network collaboration and equipment flexibility, a no-wait network flexible integrated scheduling algorithm based on idle-time optimization and process rescheduling is proposed (ITPR-NFIS). Based on the concepts of non-terminal flexible process groups, terminal flexible process groups, and virtual no-wait flexible process groups, the algorithm first determines the scheduling sequence for non-terminal flexible process groups and virtual no-wait flexible process groups using the reverse layer priority strategy and the average reverse subsequent path strategy. Then, the no-wait earliest completion strategy, the optimal completion-semi-idle triggered insertion rescheduling strategy, and the optimal completion-full-idle adaptive insertion scheduling strategy are proposed to determine the processing machine and processing time for the target process. Finally, for terminal flexible process groups, the scheduling sequence is determined based on the completion time of their reverse preceding process, and the processing machine and processing time of the terminal flexible process groups are determined by the no-wait earliest completion strategy and the optimal completion-full-idle adaptive insertion scheduling strategy. The example shows that the algorithm can effectively solve the integrated scheduling problem with no-wait constraints in cross-workshop equipment networks, whether applied to symmetric, asymmetric, or mixed-structure complex products. It significantly reduces the total processing time and enhances production efficiency.