Research On Jobshop Scheduling Problem Whit Non-linear Process Time And Multi-Processing Plans

Along with the correlative with manufacturing technology has mature, the flexibility of machines has been improved greatly in job-shop. In practice, there are some problems in job-shop such as non-linear process time, uncertain process efficiency of function groups (FG), multi-process plans (MPP) and multi-process routes (MPR), Optimal decision problem of multi-process plans, and how to design the algorithms of job-shop scheduling problems (JSP) under the problems mentioned above. Just about these, the researches are valuable and challenging for solving the job-shop scheduling problems with non-linear process time and multi-process plans. Aimed at the engineering problems mentioned above, the research has been gone along as following.Firstly, this research aims to the uncertain process efficiency of function groups (FG), a method has been proposed for forecasting the process efficiency of function groups using network characteristic analysis. By analyzing the relationship model between the network characteristic parameters and the process efficiency of function group, the results has been founded. That is that appropriate network density and network closeness centrality has positive contribution to FG performance, either too high or too low, restricts FG performance. To enhance FG productivity and achieve optimal performance, it is necessary to develop the tie relations (TR) among members, and the network should be moderate network density and keep appropriate distribution.Secondly, there are multi-process plans in job-shop, and exiting the formalization problem modeling the process plan using conventional method, so extracting the process routes based on polychromatic set is presented. Its key idea is to use standardized mathematical model to simulate different objects. Due to the availability of the standardized mathematical model, polychromatic theory has made significant progress in problem formalization. Next, the methods based on fuzzy sets (FS) and genetic algorithm (GA) has been introdued separately using to range the priority of the process routes extracted using the methods based on fuzzy sets and genetic algorithm (GA). The program improved the flexibility of process plans, and provided optional process plan for job-shop scheduling.Next, aims to job-shop scheduling problem, a process time pace network model has been constructed under multi-process plans, it provided a particular idea for modeling the job-shop scheduling. For the lopsided load of machines, load balancing model of process routes is established based on Wardrom User Equilibrium (UE) principle, and a improved genetic algorithm is designed based on UE for solving the JSP with non-linear process time and multi-process plans, and the effectiveness of the algorithm designed has been validated by comparing with other algorithms and other commercial software.At last, according to a spaceflight manufacturing enterprise, and select a process task with non-linear process time and multi-process rotues as case study, by applying the achievement of this research, the effectiveness of this algorithm designed has been validated by comparing with other algorithms and other commercial software. Finally, a softeware tools of manufacturing executive system (MES) has been inrodued simply.