Research On Optimization Of Wire Harness Process Route Based On Petri Net

Harness process route is a process knowledge that describes the order of processes and the material required. It is a main original data of harness production scheduling. To resolve the problem of routing that arrangement is not reasonable and can not be adjusted in time, modeling tool of Petri net is used to analyze the feature of harness process route; modeling is completed and the best solution is found based on the principle of time optimal.The main works of this dissertation include the following four parts:(1) The constraints in harness process route are obtained from harness process software. In order to get good combination with the modeling and process decision, the constraints are expressed in the form of a matrix.(2) The feature of harness process route under Petri net is summarized, several important theorems in Petri net are introduced; the traditional way of using Petri net is changed to calculating the matrix of the net which makes the algorithm can be programmed, great adaptability is received too; incidence matrix generation algorithm is proposed to complete the modeling of harness process route, the set of process routes is obtained; adjustment of the model in emergency is completed by the adjustment of the matrix of constraints.(3) Based on the principle of time optimal, using the results of modeling, two important theorems about matrix in Petri net are used to finish the process decision; figure precursor of task and Gantt are used to accomplish the graphical of process route; SJF (Short Job First) in OS (Operation System) is used in the process decision, which makes the algorithm simple.