Author(s)

Guanghui Wu, Haina Zhao, Xichao Zhu, Qu Wu

Corresponding Author

Guanghui Wu

Abstract

In the intelligent processing system, RGV can automatically guide the operation through the scheduling strategy. The problem of RGV allocation and scheduling is the core problem of the system operation. If the scheduling is reasonable, more processing efficiency can be obtained. In this paper, a set of RGV dynamic scheduling strategies and solving algorithms are developed for one process and two processes. For a process, the factors affecting the efficiency of the system are firstly judged. The RGV dynamic model is established with the minimum RGV moving total path as the target, and the greedy method is used as the solution algorithm. For the two processes, the rules for determining the CNC allocation scheme are first given. According to different distribution schemes, the optimal placement position of the two processes is given. The RGV dynamic scheduling model is established with the RGV moving total path as the target.

Keywords

Greedy method, flexible scheduling, Bernoulli experiment, target optimization, Em_Plant simulation