Notice of RetractionStudy on Confirming Increasable Bottleneck Device in Complex Product Dynamic 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.

Aiming at the problem that the machine is single and some machine has effect on the processing efficiency in complex product dynamic scheduling, based on the conceptions of bottleneck device classification and increasable bottleneck device, an algorithm which can confirm the increasable bottleneck device is put forward by calculating the total time of parallel operations and by analyzing the number of immediate predecessors. Calculating the total time of parallel operations for a device can confirm the shrinkable times of increasing this device. When devices have the same total time of parallel operations, choosing the device which has the most number of immediate predecessors can make more operations be processed as soon as possible. The verification and comparison of example show that the aim of improving the production efficiency is achieved by adding the increasable bottleneck device. The algorithm is simple and it can confirm the increasable bottleneck device quickly in complex product dynamic scheduling.