This paper studies the dynamic scheduling problem of bionical intelligent RGV, Modeling and Simulation of RGV scheduling problem in 4 cases of bionical intelligent machining system, and the simulation results of the model are tested by using three sets of real working data of RGV. Under known conditions, according to the working condition of a process, the RGV scheduling path is taken as the decision variable, and as much as possible clinker is processed as the objective function. Based on the idea of 01 planning, the RGV dynamic scheduling model is established when a process does not occur. Then a heuristic algorithm is constructed for the modeled model, Through simulation, the total production of materials under three sets of parameters is 383, 358, 392, and the system operation efficiency is not less than 98%. For the random failure of the processing system, the random failure probability is increased to 1% on the existing model, and the manual troubleshooting is performed. The duration is subject to the uniform distribution of 10~20 minutes, and the RGV dynamic scheduling model for single and double process machining under the condition of CNC probability failure is established. The total production of materials under one process is 357, 336, 362 respectively. The efficiency is as high as 98.3%, 95.9% and 98.4%; the total production of materials under the two processes is 223, 336, 362 respectively. Industry efficiency were 95.7%, 96.7% and 96.2%. Data simulation results show that the dynamic scheduling model for the establishment of RGV and practical algorithm.
Bionical intelligent RGV; Multiobjective optimization; Optimal scheduling; Simulation; 01 planning
The RGV is an bionical intelligent vehicle that can run freely on a fixed track. The material processing system of RGV can save huge labor costs for factories such as manufacturing factories and logistics centers. Figure 1 gives an example of this guidedvehicle system [1]. Unlike the classical material processing system, many bionical intelligent RGVs in modern processing systems no longer use fixed path, bionical intelligent R. The scheduling scheme of GV is realized by programming [2,3]. Literature [4] presents several algorithms for solving dynamic PDPTW model. RGV scheduling problem is one of the most important issues in material processing system [5,6]. The performance of material processing system has a decisive impact on the efficiency of the whole equipment [7]. In the design of scheduling path, the most common performance criterion is to minimize the total distance of RGV under given system parameters [8,9]. Due to the different working environments, there is still no ideal algorithm to optimize the RGV scheduling path. Therefore, there is still a lot of research space for the dynamic scheduling of RGV in the specific system working environment.
Figure 1: Guidedvehicle system schematic.
The remainder of this paper is organized as follows. Section 2 describes the recent stateoftheart in bionical intelligent vehicle’s parameters. We discussion the condition of the problems in the study we may meet in section 3. Section 4 is the hypothesis we assumed in the study. And the section 5 is the symbol description. Section 6 describes in detail the proposed dynamic programming model based on 01planning. Section 7 tested the proposed method using actual data. Finally, section 8 concludes this study, outlining its contributions and possible directions for future work.
System operation parameters
The working environment studied in this paper consists of 8 CNCs, 1 RGVs, 1 RGV linear track, 1 feeding conveyor, 1 feeding conveyor and other equipment. Figure 2 shows the schematic diagram of this material processing system.
Figure 2: Intelligent processing system schematic.
The operating parameters of this material processing system are derived from the latest available literature [1013].
System operation parameters 
Group 1 
Group 
Group 
The time required for RGV to move one unit 
20 
23 
18 
The time required for RGV to move two unit 
33 
41 
32 
The time required for RGV to move three unit 
46 
59 
46 
The time required for CNC to process materials for one process 
560 
580 
545 
The time required for CNC to complete the first process of twoprocess material 
400 
280 
455 
The time required for CNC to complete the second process of a twoprocess material 
378 
500 
182 
RGV is the time required for CNC #1, #3, #5, #7 to load and unload at one time 
28 
30 
27 
RGV is the time required for CNC #2, #4, #6, #8 to load and at one time unload 
31 
35 
32 
RGV takes time to complete a material cleaning operation 
25 
30 
25 
Table 1: 3 sets of data sheets for intelligent processing system operating parameters.
Three specific cases
• The material processing operation of one process, the same tool is installed for each CNC, and the material can be processed on any CNC
• In the process of material processing in two processes, the first and second processes of each material are processed by two different CNCs in sequence
• The CNC may malfunction during the machining process (the probability of failure is about 1%). It takes 10 to 20 minutes for each manual failure (unfinished material scrap) [1214]. After the troubleshooting, the CNC immediately joins the sequence. Require separate consideration of material processing operations for one process and two processes
Research task
• We study the three working conditions and give the dynamic scheduling model of RGV
• The model is tested by using three sets of data of the system operating parameters in Table 1, and the scheduling strategy of RGV and the operating efficiency of the system are given
This paper studies the dynamic scheduling problem of RGV in intelligent processing system. According to the working requirements of RGV, under the actual operating rules of intelligent system, three general problems are considered: material processing operation in one process, material processing operation in two processes, and CNC failure. In the case of a process and two processes of material processing operations. The RGV dynamic scheduling model is established, and the corresponding algorithm is given. The practicality of the model and the effectiveness of the algorithm are tested by using the three sets of system operating parameter data respectively. The scheduling strategy of RGV and the operating efficiency of the system are given.
Analysis of task (1)
For the case (1): In the working process of the intelligent processing system, RGV can only load and unload one CNC at a time. The relationship between RGV and 8 CNCs per round can be expressed by 01 logic variable. The maximum amount of material obtained is taken as the objective function. The processing rule in the intelligent processing system is used as the constraint condition. Based on the 01 planning idea, the RGV dynamic scheduling model under a process processing demand is obtained. Construct a heuristic algorithm and solve the model through simulation [15].
For the case (2): This paper considers that the maximum amount of RGV work is the largest as the objective function, and the constraint condition corresponding to the new machining rule is added to the original constraint to establish a double target based on the maximum number of materials obtained. The planned RGV dynamic programming model under the two process processing requirements, and gives a concrete feasible solution algorithm.
For the case (3): When the CNC has a 1% probability of failure, the repair time of the faulty CNC can be regarded as a long processing time, and the time for manual troubleshooting is uniformly distributed within 10 to 20 minutes. After the fault is removed, the CNC restarts. At this time, the waste material has been removed, and the CNC immediately issued a demand instruction. These work rules are embedded into the established dynamic scheduling model to obtain the RGV dynamic programming model under the condition of CNC probability failure, and the model is solved by simulation.
The dynamic programming model is one of the optimization methods in solving the dynamic scheduling problem [16,17]. The problem it deals with is a multistage decision problem, which starts from the initial state and reaches the end state by selecting the intermediate stage decision [18,19]. These decisions form a sequence of decisions and define an activity path (usually the optimal route of activity [20]) that completes the entire process.
Initial state → ? decision 1 ? → ? decision 2 ? → .. → ? decision n ? → end state
The design of dynamic programming has a certain pattern, generally going through the following steps:
• Division stage: According to the time or space characteristics of the problem, the problem is divided into several stages. These stages must be ordered or orderable (ie, no backwardness), otherwise the method fails
• Determining state and state variables: The various objective situations in which problems are developed into phases are represented in different states. Of course, the choice of state should be met without inefficiency. From the perspective of graph theory, if the state in this problem is defined as a vertex in the graph, the transition between the two states is defined as the edge, and the weight increment in the transfer process is defined as the weight of the edge, then the composition A directed acyclic weighted graph, therefore, this graph can be "topologically ordered [21], at least in the order of their topological ordering
• Determine the decision and write the state transition equation: Because decision and state transition have a natural connection, state transition is based on the state and decision of the previous phase to derive the state of this phase. So if the decision is determined, the state transition equation can be written. But in fact, it is often done in reverse, determining the decision based on the relationship between the states of the two adjacent segments. The sequence of decisions made at each stage is called a strategy
• Finding Boundary Conditions: The given state transition equation is a recursive equation that requires a recursive termination condition or boundary condition. The main difficulty of dynamic programming lies in the theoretical design. It is true that the role of dynamic programming is very large
Analysis of task (2)
For task (2): use three sets of system operation parameters to test the solution results, define W_{CNC} (the working efficiency of the CNC), and use this index to measure the practicability of the scheduling model.
In order to reduce the complexity of the problem and simplify the establishment and solution of the model, this paper makes the following assumptions before establishing the model
• It is assumed that the CNC machining time is constant and consistent for a certain process determined [22]
• It is assumed that the RGV will not load or unload the RGV until it moves to the CNC position after receiving the loading request from the CNC [23]
• It is assumed that the probability of failure occurs during the processing of one process material and the processing of materials in each step of the two processes is regarded as 1%
• Due to safety requirements, the tool cannot be replaced in the middle until the system stops working after the system is started
• Unless the system stops working for 8 hours of continuous operation, the RGV's movement, loading and unloading, cleaning, etc. will not be stopped midway [24]
Symbol 
Description 
unit 
k 
Number of loadings in the processing system 
time 
t_{1} 
RGV’s loading and unloading time in one cycle 
s 
t_{2} 
RGV’s cleaning time in one cycle 
s 
t_{3} 
RGV’s movement time in one cycle 
s 
C_{i} 
material within 8 hours 
time 
_{fi} (k ) 
The status of the material on the first CNC 

T ^{(k} ^{)} 
The maintenance time of the ith CNC at the s 

^{W}CNC 
Intelligent processing system's working 
s 
Note: Other symbols are specified in the text.
In the intelligent processing system, RGV can compare the remaining machining time of 8 CNCs, the loading and unloading time, and the time required for RGV to move to the corresponding CNC position. This kind of RGV can judge the material order and advance to the next round of optimal CNC [25]. Departure, making the overall waiting time of 8 CNCs within 8 hours the least. In this paper, RGV is used as the object of dynamic scheduling, and the RGV dynamic scheduling model is established and solved. The optimal scheduling scheme of RGV under three specific working conditions is compared.
The intelligent working system has a continuous working time of 8 hours, which makes 8 hours a complete processing process. The goal of dynamic scheduling is to minimize the total nonworking time of the CNC within 8 hours. It is easy to know the total time of a complete machining process of the intelligent processing system is
T = 8h = 28800s (1)
During a complete machining process, the machining system is started, the RGV executes the command from the initial position, and the machining is stopped near the 28800s, at which time the RGV returns to the initial position. The RGV workflow is shown in Figure 3.
Figure3: RGV work flow chart.
Model establishment of case (1)
For a processing system with only one process, the goal of the RGV dynamic scheduling model is to maximize the processing efficiency, that is, to process the material as much as possible within a given time, so that the number of processed materials is as large as possible. In the intelligent processing system, when one RGV is dispatched to load and unload 8 CNCs arranged on both sides,
the kth wheel of the RGV trolley can only go to and from the ith CNC, and the 01 variable x_{i}^{?}^{k} ^{?} is introduced.
In equation (2), i ?1,2, , n and in this context, eight CNCs in the intelligent system are represented. When the material is in the processing state, the corresponding CNC must be in the working state;
when the material is in the nonprocessing state, the CNC without the working state corresponds to it. Defining the RGV operation for each CNC and only operating once and finally returning to the starting position is a cycle. In the intelligent system, the RGV goes to the ith CNC to complete the working cycle of the workingcycle in the kth round t_{i }^{(k)} can be expressed as
Where t_{1,i }^{(k) } is the time when the CNC is loaded and unloaded once, t_{2,i }^{(k)} is the time when the RGV completes the material cleaning, and is the time when the RGV moves. When the CNC's operating parameters are given, is known in the same operating system, so the relative size of the total time taken by the RGV to go to the ith CNC to complete a working cycle when the RG is loaded in the kth wheel is only determined. Through the above analysis, the objective function of the RGV scheduling model in one process is as follows
Where C_{i} is the number of materials processed by the first CNC within 8 hours of a complete working process.
Before the processing system is loaded, the CNC used is divided into two types: processed material and unprocessed material.
Where f_{i} ^{(k)} is the material status on the first CNC before the kth wheel is loaded. When the processing system is working, RGV can only work on one CNC at a time, loading and unloading, and the constraints on the decision variable x_{i} ^{(k)} in the scheduling model are as follows.
Within 8 hours of a complete machining process, the greater the total working length of 8 CNCs, the higher the efficiency of the processing system. We geti is the CNC number in the system, and (7)
Where k denotes the first loading of the processing systemmeans that the total working length of 8 CNCs does not exceed 28800s during a complete machining process.
After the processing system is turned on, the total working time of 8 CNCs is 0 before the first round of loading. Which is
In summary, after the simultaneous objective function and constraints, the RGV dynamic scheduling model with the largest total working time of 8 CNCs in 8h is established as follows
Model establishment of case (2)
For the work with two processes, the first process and the second process of each material must be processed by two different CNC processes. For the entire twostep process, when a CNC completes the second process, the CNC is in a wait state and sends a demand signal to the RGV. When the RGV moves to the front of the CNC, the following steps are continuously performed:
Loading and unloading: remove the clinker from this CNC; when the last time RGV was done in the process, put a new semiclinker into the CNC; when the last time RGV was done in the second step, the CNC did not put it in the CNC. Enter any material. Cleaning operation: The clinker taken out is cleaned. At this time, the position of RGV is unchanged in the orbit. RGV finds the next CNC to work according to the order of the demand signal and the distance of the distance. Repeat the above steps of “loading and unloading” and “cleaning operation” until the end of 8 hours.
When the process requires two processes, the material process status factor X ( k ) and the CNC process type factor Yi are introduced. When the two factors match successfully, the RGV can continue to load and unload. At this time, there are 256 kinds of tool distribution schemes for 8 CNCs in the intelligent processing system. This paper establishes a dualobjective planning model for processing system RGV scheduling within 8 hours.
Based on the case (1) The objective function formula (4) with the largest number of production materials within 8 hours has been established, and the objective function is increased as follows
Among them, the working parameters of the working system such as the length of one loading and unloading t_{1,}^{(}^{k}_{i} ^{)} and the length of one material cleaning t_{2,}^{(}^{k}_{i }^{) } are given by Table 1. For the work case with two processes, in addition to the constraints (6)(8), it is necessary to add and increase the constraints as follows
Where equation (11) indicates that in a machining shift, a CNC can only process a specified process with one type of tool installed.
Where equation (12) represents the two states of the material to be processed. When loading in the kth round, only when the material is successfully paired with the CNC can be loaded, which is
In summary, in the case of two processes, the dualobjective planning model for RGV dynamic scheduling is as follows
Model establishment of case (3)
For the case of random failure in the intelligent processing system, the situation (3) has pointed out that the probability of failure is about 1%, and it takes 10 to 20 minutes to manually process the failure. After the troubleshooting, the CNC immediately joins the operation sequence. The RGV dynamic scheduling model with random faults is established. On only one process and the existing model with two processes, the constraints are added, so that the improved scheduling model can collect fault information and update the RGV work instructions.
During the working process of the processing system, the probability of a CNC failure is determined, that is
Among them, it indicates that the ith CNC has failed during the loading in the kth round. After a failure, the manual repair time is 10 to 20 minutes, that is
Among them, T_{repair,i }^{(k)} is the maintenance time after the failure of the ith CNC in the kth wheel loading. When S_{i }^{(k)} occurs, the ith CNC at the time of loading in the kth round cannot work normally according to the original setting, that is
At this point, manual repair is required to remove the waste, which is
In summary, the constraints (15)(18) on the random failure in the processing system are added to the scheduling model (9) of a process, and the RGV scheduling model for one process and random failure is as follows
Adding the constraints (15)(18) on the random faults in the processing system to the scheduling model (14) of the two processes, the RGV scheduling model with two processes and random failures is as follows
The abovementioned planning problems involve as many as tens of thousands of decisionmaking variables, and it is impossible to use traditional planning methods for computer solving. For the kround machining process of 8 CNCs in RGV bionical intelligent processing system, the optima candidate CNC is selected in real time, which involves the calculation of O (N !). It is an NP problem, that is, the nondeterministic problem of polynomial complexity. Excellent solution, In this paper, a heuristic algorithm is constructed by each round of loading and unloading time, and the simulation problem model is used to solve such planning problems. Define WCNC (the system's work efficiency), which is used to measure the efficiency of the RGV scheduling model under different types of work.
Solution of the model in three cases
For the case where there is only one machining program and no failure, use MATLAB to simulate the planningmodel (9). The results based on the three sets of given operating parameters are shown in table 2.
Objective 
CNC 
Parameter group 1 
Parameter group 2 
Parameter group 3 

^{t}up 
^{t}down 
^{t}up 
^{t}down 
^{t}up 
^{t}down 

1 
1 
0 
588 
0 
629 
0 
572 
2 
2 
53 
644 
60 
689 
52 
629 
3 
3 
129 
721 
148 
778 
127 
705 
4 
4 
182 
774 
208 
838 
179 
757 
5 
5 
258 
851 
296 
927 
254 
833 
358 
6 
26317 
26908 
28163 
28795 
25696 
26273 
383 
7 
28167 
28758 
27503 
28080 

392 
8 
28132 
28709 
Table 2: Scheduling strategy for case (1).
In table 2, and are the loading start time and the blanking start time, respectively. It can be found that when there is only one machining program and no failure occurs, the CNC is used to present a working cycle of 1 → 2 →→ 7 → 8 The RGV scheduling process at this time is shown in figure 4.When RGV works in parameter group 1, 383 materials are processed in one complete working process, which lasts 28758s; when RGV works in parameter group 2, 358 materials are processed in one complete working process, which lasts 28795s; when RGV is parameter group 3 At work, a total of 392 materials were processed during a complete work, which lasted 28,709 s.
Figure 4: RGV Scheduling Diagram for case (1).
For the case of two machining programs without failure, use MATLAB to simulate the planning model (14). The results based on the three sets of given operating parameters are shown in table 35.
Objective number 
Process one 
^{tt}up 
^{t}down 
Process two CNC 
^{t}up 
^{t}down 
1 
1 
0 
428 
2 
456 
884 
2 
4 
48 
507 
3 
538 
991 
3 
6 
99 
586 
5 
617 
1095 
248 
8 
27777 
28228 
7 
28259 
28710 
Table 3: Case (2) Scheduling strategy for parameter group 1.
It can be seen from table 3. that when the processing system with two processes works in parameter group 1, a maximum of 248 clinker can be produced in one complete work process, and CNCs numbered 1, 4, 6, and 8 are used in the first process. The CNC numbered 2, 3, 5, and 7 perform the second process on the material, and the total time is 28,710 s. The RGV scheduling process at this time is shown in figure 5.
Figure 5: Case (2) Scheduling strategy for parameter group 1.
Objective number 
Process one CNC 
^{t}up 
^{t}down 
Process two CNC 
^{t}up 
^{t}down 
1 
1 
0 
310 
2 
340 
985 
2 
4 
53 
398 
3 
433 
1103 
3 
5 
111 
486 
6 
516 
1221 
195 
1 
27727 
28135 
8 
28224 
28945 
Table 4: Case (2) Scheduling strategy for parameter group 2.
It can be seen from table 4 that when the processing system with two processes works in parameter group 2, a maximum of 195 clinker can be produced in one complete working process, and CNCs numbered 1, 4, and 5 are used in the first process. The CNC numbered 2, 3, 6, 7 and 8 perform the second process on the material, and the total time consumption is 28945s. The RGV scheduling process at this time is shown in Figure 6.
Figure 6: Case (2) Scheduling strategy for parameter group 2.
Objective number 
Process one CNC 
^{tt}up 
^{t}down 
Process two 
^{t}up 
^{t}down 
CNC 

1 
2 
0 
487 
1 
519 
791 
2 
4 
50 
564 
3 
596 
953 
3 
6 
100 
641 
5 
673 
1175 
227 
2 
27736 
28347 
5 
28411 
28818 
Table 5: Case (2) Scheduling strategy for parameter group 3.
It can be seen from table 5 that when the processing system with two processes works in parameter group 3, a maximum of 227 clinker can be produced in one complete working process, and CNCs numbered 2, 4, 6, 7 and 8 are used in the first process. The CNC numbered 1, 3, and 5 perform the second process on the material, and the total time consumption is 28818s. The RGV scheduling process at this time is shown in Figure 7. It is easy to know, and has two processes and does not occur. In the randomly faulty RGV working system, among the three sets of given operating parameters, parameter group 1 can be used to produce the most clinker.
Figure7: Case (2) Scheduling strategy for parameter group 3.
For the case of only one machining program and random failure, use MATLAB to simulate the planning model (19). The solution results based on the three sets of given operating parameters are shown in Table 6.
Objective 
CNC 
Parameter group1 
Parameter group 2 
Parameter group 3 



^{t}up 
^{t}down 
^{t}up 
^{t}down 
^{t}up 
^{t}down 
1 
1 
0 
635 
0 
670 
0 
619 
2 
2 
53 
688 
60 
730 
52 
671 
3 
3 
129 
764 
148 
818 
127 
746 
4 
4 
182 
817 
208 
878 
179 
798 
5 
5 
258 
893 
296 
966 
254 
873 








336 
2 
26466 
27088 
28140 
28810 
26182 
26801 








357 
1 
28147 
28785 


27855 
28474 








362 
7 




28161 
28780 
Table 6 Scheduling strategy with one operation and random failure.
In table 6, when there are two machining programs and there is a random failure, the CNC also exhibits a working cycle of 1 → 2 →→7 → 8 . When RGV works in parameter group 1, a total of 357 complete materials are processed in one complete working process, and 336 clinker materials are processed in the whole working process. The random fault occurs once and lasts for 28810s. When RGV works in parameter group 3, once A total of 362 complete materials were processed during the complete work process, and random failures occurred 4 times for a total duration of 28,780 s.
For the case of two machining programs with random faults, use MATLAB to simulate the planning model (20). The results based on the three sets of given operating parameters are shown in table 79.
Objective number 
Process one CNC 
^{tt}up 
^{t}down 
Process two CNC 
^{t}up 
^{t}down 
1 
1 
0 
475 
2 
503 
978 
2 
4 
48 
554 
3 
585 
1085 
3 
6 
99 
633 
5 
664 
1189 
223 
6 
27647 
28214 
2 
28278 
28845 
Table 7: Scheduling strategy for parameter group 1 under two processes and random failures.
It can be seen from Table 7 that when the processing system with two processes works in the parameter group 1, a maximum of 248 clinker can be produced in one complete working process, and the random failure occurs twice in each of the first and second steps, numbered 1 The CNC of 4, 6, and 8 perform the first process, and the remaining 4 CNCs perform the second process, with a total time of 28,845 s.
Objective number 
Process one CNC 
^{tt}up 
^{t}down 
Process two CNC 
^{t}up 
^{t}down 
1 
1 
0 
352 
2 
382 
1069 
2 
4 
53 
440 
3 
475 
1187 
3 
5 
111 
528 
6 
558 
1305 
192 
1 
27545 
27858 
3 
27911 
28632 
Table 8: Scheduling strategy for parameter group 2 under two processes and random failures.
It can be seen from Table 8 that when the processing system with two processes works in parameter group 2, up to 195 clinker can be produced in one complete work process, and random failure occurs once in process one, and does not appear in process two. The total time is 28945s.
Objective number 
Process one CNC 
^{t}up 
^{t}down 
Process two CNC 
^{t}up 
^{t}down 
1 
2 
0 
534 
1 
566 
838 
2 
4 
50 
611 
3 
643 
1000 
3 
6 
100 
688 
5 
720 
1222 
228 
7 
27762 
28401 
5 
28446 
28766 
Table 9: Scheduling strategy for parameter group 3 under two processes and random failures.
It can be seen from table 9 that when the processing system with two processes works in parameter group 3, up to 227 clinker can be produced in one complete work process, and random failures occur three times in process one and process two, respectively. It is 28818s. It is easy to know that for the RGV working system with two processes and random failure of 1%, among the three sets of given operating parameters, parameter group 3 can be used to produce the most clinker.
Work efficiency solution
In an bionical intelligent system, RGV essentially provides services for the CNC, so that Tm is the total working time of a complete working process, n is the number of CNCs, t pi is the actual working time of the iposition CNC in the entire working hours, and defines the CNC. The work efficiency indicators are as follows
where in equation (21), WCNC is the ratio of the sum of the actual working hours of all CNCs to the total working time of all CNCs, and the larger WCNC , the higher the operating efficiency of the bionical intelligent system. In the design of RGV dynamic scheduling, when the number of produced materials is as much as the objective function, the CNC waiting time should be reduced as much as possible, and the actual working time should be increased to improve the overall working efficiency of the bionical intelligent system. Using equation (21), the working efficiency of the machining system under three working conditions of one process, two processes and random failure is shown in table 10 and table 11.
No Random failure 
Parameter group 1 
Parameter group 2 
Parameter group 3 

One 
Two 
One 
Two 
One 
Two 

process 
processes 
process 
processes 
process 
processes 

Objective number 
383 
248 
358 
195 
392 
227 
åt _{pi} 
226320 
223856 
226224 
224105 
226159 
224271 
nT_{m} 
230064 
229680 
230360 
231560 
229672 
230544 
^{W}CNC 
0.98373 
0.97464 
0.98205 
0.96781 
0.9847 
0.97279 
Table 10: Work efficiency of situation (1) and situation (2).
In Table 10 , T_{m} is the total working time of a complete working process, t_{pi} is the number of CNCs, and W_{CNC} is the actual working time of the CNC in the entire working time, which is obtained by equation (21). From Table 10, it can be seen that in a processing system with only one process and no random failure, RGV has the highest working efficiency when producing clinker according to the third group working parameters, and the processing system has two processes without random failure. Working with the first set of parameters is the most efficient.
^{Random} 
Parameter group 1 
Parameter group 2 
Parameter group 1 
Parameter group 2 
Parameter group 1 
Parameter group 2 
One process 
Two process 
One process 
Two process 
One process 
Two process 

Objective number 
357 
223 
336 
192 
362 
228 
^{åt}pi 
226290 
221031 
221100 
221508 
226559 
221499 
nT_{m} 
230280 
230760 
230480 
229056 
230240 
230128 
0.98267 
0.95784 
0.9593 
0.96705 
0.98401 
0.9625 
Table 11: Working efficiency of one process and two processes under random failure.
In Table 11, W_{CNC} is also obtained by the formula (21). When the intelligent processing system has only one process but there is a random failure, RGV still produces the clinker according to the third group working parameters, and the working efficiency is the highest. When the processing system has two processes but a random failure occurs, the work of the second group of parameters is performed. The most efficient. When using the established RGV scheduling model to plan the work of the intelligent processing system, no matter which operating parameters the processing system works, the processing efficiency of the system will not be lower than 95%.
In this paper, the dynamic scheduling of 8 CNC machining systems is studied. The RGV scheduling scheme under different working conditions is given, and the working efficiency of the system is calculated. The simulation results show that the dynamic scheduling model and algorithm for bionical intelligent RGV are feasible. In actual production, when the number of CNCs in the processing system increases, genetic algorithm and ant colony algorithm can also be considered to calculate the tool distribution scheme, thereby improving the calculation efficiency.
We have no conflict of interests to disclose and the manuscript has been read and approved by all named authors.
This work was supported by the Philosophical and Social Sciences Research Project of Hubei Education Department (19Y049), and the Staring Research Foundation for the Ph.D. of Hubei University of Technology (BSQD2019054), Hubei Province, China.
Citation: Zhao B, Cao J, Mingzhe E (2020) Biostatistical Analysis on Bionical Intelligent RGV. J Clin Stud Med Case Rep 7: 084.
Copyright: © 2020 Jinming Cao, et al. This is an openaccess article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.