Notice of RetractionComplex multi-products dynamic scheduling algorithm with sequence-dependent setup times

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

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 multiproduct 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 ¹ 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.