Job Shop Production Scheduling Based On Evaluation Of Node Importance

Job shop scheduling is a key link in the manufacturing process.Job shop scheduling is typical in scheduling problems.Based on the dynamic,randomness and uncertainty of the product manufacturing system,this paper takes the job shop as the research object,and combines the complex network theory to evaluate the node importance of the product manufacturing process.Through the analysis of the relationship between the important node identification and production scheduling,the two parties are combined to study,and a new method is proposed to judge the node importance.Then,based on the important machine nodes,the corresponding key process sets are judged,and the appropriate scheduling is carried out based on the important nodes,and the shorter the delivery time is more,the more priority is the more priority the delivery time is.The rules of the workshops are optimized for scheduling.Maximize the capacity of important machine nodes to enhance the entire output and economic benefits of the manufacturing system.First,the job shop is taken as the research object,combined with complex network,a multi task weighted directed network is established.Then,based on the workshop production network,the existing analysis is only to study the characteristics of the network,and it is difficult to fully reflect the importance of the nodes,and can not effectively identify the important nodes of the actual application.Considering the self characteristics of the resource nodes and the influence of the characteristics of their neighbor nodes on the node importance,three network characteristics are extracted from the degree centrality,clustering coefficient and close centrality,and a multi attribute decision algorithm is proposed to judge the importance of the node from different aspects and the importance of the multi attribute decision algorithm to the resource nodes.Make a judgment.Then,based on the important machine nodes,the corresponding key process sets are judged.According to the characteristics of the job shop scheduling problem,the shorter and more priority rules of the delivery time are adopted,and the relevant mathematical models are created.Finally,the importance degree of nodes is identified based on a 6 job 6 job shop scheduling basic example.The heuristic rule is used to carry out two general scheduling algorithms for the scheduling of important resource nodes and the heuristic rules.The advantages of the heuristic rule algorithm based on the node importance are shown by the simulation and the Gantt chart.