RGV Dynamic Scheduling and Process Optimization Model based on Greedy Strategy
This paper constructs a dynamic scheduling simulation model of greedy strategy and a model of maximum efficiency process scheduling optimization model for the problem of RGV dynamic scheduling.Firstly,by calculating the expected path length,the minimum expected path length process allocation optimization model is established,and the optimal solution is solved by MATLAB software.Combined with the given examples,the CNC process assignment under the specified parameters is determined.After that,through the two-process CNC combination allocation method,a two-process greedy strategy scheduling simulation model was constructed.In order to determine the specific combination of the process,we set the maximum efficiency process scheduling optimization model with the highest efficiency and the process combination allocation as the decision variables.Because the model is more complex,this paper introduces a genetic algorithm to solve it.Finally,the dispatching result of the three sets of fault-free conditions under the three sets of specified parameters is 187,85,and 241 pieces of materials processed in one shift.
Greedy strategy Scheduling optimization RGV dynamic scheduling Process allocation
Liu Chen
College of Computer Science and Technology,Jilin University,Changchun,Jilin,130012,China
国际会议
重庆
英文
307-309
2019-05-30（万方平台首次上网日期，不代表论文的发表时间）