RETRACTED: Complex multi-products dynamic scheduling algorithm with sequence-dependent setup times (Retracted Article)

The problem of considering the setup times in scheduling with non-sequence constraint between operations has been researched, but there are no researches on the problem of considering the setup times in processing and assembly integrated scheduling of complex multi-product dynamic scheduling with sequence constraint between operations. So, a complex multi-product dynamic scheduling algorithm is proposed, considering sequence-dependent setup times. The algorithm constructs the virtual manufacturing tree in the way of root alignment and converts the complex multi-product dynamic scheduling problem to the complex single product scheduling problem. After the scheduling sequence of operations is determined, the starting time of each operation is determined by dynamically inserting setup time once. As the (1) proposed algorithm avoids several movements of the scheduled operation when the setup time is inserted, the time complexity is sharply reduced. Theoretical analysis and examples show that the proposed algorithm not only can solve the complex multi-product dynamic scheduling problem with sequence-dependent setup times, but also is simple and practical.