Education, Science, Technology, Innovation and Life
Open Access
Sign In

RGV Dynamic Scheduling and Process Optimization Model based on Greedy Strategy

Download as PDF

DOI: 10.23977/amce.2019.051

Author(s)

Liu Chen

Corresponding Author

Liu Chen

ABSTRACT

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.

KEYWORDS

Greedy strategy, Scheduling optimization, RGV dynamic scheduling, Process allocation

All published work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.