“…In Fig. 4, we assume that its data similarityis less than 0.3, and then through analysis,three different paths and the corresponding shortest and longesttime S can be obtained, as shown below: If β ≥ 1, F = (T 0 , T 1 , T 2 , T 6 , T 8 , T 9 , T 10 ), S = [8,16]; If β < 1 and α ≥ 1, F = (T 0 , T 1 , T 2 , T 6 , T 8 , T 9 , T 10 ), S = [11,21]; If α < 1 β < 1 and γ ≥ 1, F = (T 0 , T 1 , T 2 , T 6 , T 8 , T 9 , T 10 ), S = [14,24]; Here, we assume that the resources of the threehospitals are α, β and γ , respectively, and then select an optimalscheduling strategy by analyzing the number of resources indifferent situations.…”