Multi-flexible integrated scheduling algorithm for multi-flexible integrated scheduling problem with setup times

Abstract

<abstract> <p>To address the multi-flexible integrated scheduling problem with setup times, a multi-flexible integrated scheduling algorithm is put forward. First, the operation optimization allocation strategy, based on the principle of the relatively long subsequent path, is proposed to assign the operations to idle machines. Second, the parallel optimization strategy is proposed to adjust the scheduling of the planned operations and machines to make the processing as parallel as possible and reduce the no-load machines. Then, the flexible operation determination strategy is combined with the above two strategies to determine the dynamic selection of the flexible operations as the planned operations. Finally, a potential operation preemptive strategy is proposed to judge whether the planned operations will be interrupted by other operations during their processing. The results show that the proposed algorithm can effectively solve the multi-flexible integrated scheduling with setup times, and it can also better solve the flexible integrated scheduling problem.</p> </abstract>