Notice of RetractionStudy on integrated algorithm of complex multi-product flexible scheduling

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.

In order to optimize the processing of complex multi-product flexible scheduling, a simplified method which converts complex multi-product into a virtual single-product is adopted. The complex multi-product flexible scheduling problem is transformed into the virtual single-product flexible scheduling problem. Aiming at the virtual single-product flexible scheduling problem, an integrated algorithm is proposed. This algorithm firstly adopts the allied critical method to confirm the scheduling sequence of operations. Then each operation is simulation processed by the sequencing algorithm on a set of capable machines. Calculate the virtual completion time of this operation and choose the machine which has the minimum virtual completion time. The routing sub-problem and sequencing sub-problem are solved at the same time by the proposed algorithm. Experiment shows that the proposed algorithm can solve complex multi-product flexible scheduling problem with constraint between jobs, it also can solve simple multi-product flexible job-shop scheduling problem with non-restraint between jobs and obtain satisfying result.