Research On Complex Product Manufacture Scheduling Based On Dynamic Critical Path

Most of the current research on production scheduling problem can only solve the simple product scheduling problem with non-restraint among jobs, and without considering the complex product scheduling problem which has constraint relationship among jobs. But in fact, there exist constraint relationship among jobs in many scheduling. So if we don't consider the constraint relationship among jobs during making the production scheduling plan, the plan is not feasible. So the scheduling problem of complex product studied in this paper has important theoretical and practical significance.In view of allied critical path method of complex product scheduling algorithm have been proposed, without considering the problem of the critical path length of the product take change with scheduling impacts the effect of the scheduling, a scheduling algorithm based on dynamic critical path is presented. For the scheduling problem of complex single product, according to the processing flow of the product builds a processing operation tree for the product. The leaf nodes of the tree delegates the operation first scheduled, the root node delegates the last one, and the lines delegate the order of operation partial relations. During the scheduling an operation collection is dynamically generated according to the processing operation tree.Then operation are selected from the standby operation set with dynamic critical path strategy and short-time strategy, and scheduled it with best fit scheduling method until the set is empty, that means all operations have been processed.After the research of the single-product, a complex multi-product scheduling problem algorithm is put forward. The algorithm transforms multi-product into a virtual product, and constructs a virtual processing operation tree. Then solve the multi-product scheduling problem by using single-product way. Since the existence of the same-function equipment, which expands the choice of the equipment, and increases the difficulty of the solving the problem. In view of this complex combinatorial optimization problem, an equipment selection strategy is put forward. The selection of scheduling operation and the equipment used by operation will be separated to treat combined with dynamic critical path and complex multi-product scheduling algorithm, which achieves the scheduling optimization of complex multi-product with the same-function equipment.Finally, a scheduling emulator software is developed using Visual C++6.0.