Research On Confirming Increasable Bottleneck Device Based On Static Parallel Time

Now community needs more products of more varieties and small batches, and bottleneck problem of complex product integrated scheduling will gradually become a research hotspot. In this paper, based on the analysis and study at home and abroad, aiming at the problems that there is a big difference between the parallel total time of operations and real parallel time in integrated scheduling of complex product to confirm increasable bottleneck device by calculating parallel total time of operations, and an algorithm which can confirm the increasable bottleneck device based on static parallel time is presented. Because high costs and depreciation charges, company can not blindly add a certain device, and the algorithm which confirms the increasable bottleneck device by calculating static parallel time is presented in this paper in accordance with reality and justifiable.Subject to the constraints, this paper is how to find the increasable bottleneck device in the integrated scheduling of complex product to schedule each operation and minimize the total processing time. Propose a new algorithm which is calculating operation static parallel time confirming increasable critical device in the integrated scheduling of complex product . Firstly, according to product tree model calculate operation's starting time and ending time,then according to overlapping projection calculate operation static parallel time,select a device which is that static parallel time is the largest as increasable critical device.A method of constructing virtual manufacturing tree for multi-product or dynamic product is proposed to simplify these kinds of problems. Aiming at dynamic product scheduling problem, when dynamic product arrives, firstly, a processing tree of virtual product, consisting of remaining (remaining operations is included) and new products, is constructed. Then according to the processing tree of virtual product, calculates the static parallel time according to the method for dealing with single product. Select a device whose static parallel time is the largest as an dynamic increasable bottleneck device. When new products arrive to be processed, the remaining operations have priority to schedule, so that products being processed will not be interrupted, the rest of operations adopt ACPM to confirm scheduling order.In this paper, due to considering scheduling possible positions of operation there is a small difference between the static parallel time of operations and real parallel time, so the algorithm which confirms the increasable bottleneck device is presented in accordance with reality and justifiable.Experiment shows that adding an increasable bottleneck device can obviously improve production efficiency, and the algorithm has favorable complexity. So the algorithm has important value both in practice and theory.