Notice of RetractionStudy on Confirming Increasable Bottleneck Device in Complex Product Dynamic Scheduling

Abstract

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.