Abstract: The deep and large-scale development trend of underground mines,coupled with the increasing deployment of
equipment,makes the multi-equipment scheduling under complex constraints crucial for ensuring efficient mine production. To
address the multi-equipment collaborative scheduling problem,a corresponding model based on a greedy algorithm is proposed.
Firstly,a scheduling model is constructed with the objective of minimizing the total waiting time for equipment and strips,and
the original model is decomposed according to the precedence relationship of tasks. Then,the greedy algorithm is utilized to
solve the sub-models,and finally,the solutions of the sub-models are integrated based on the temporal relationships of the model
to obtain the final scheduling scheme. Using production data from the Southeast Orebody of Qianbixi Mine as the model foundation,
12 sets of solutions calculated by the greedy algorithm and 2 sets of ones by the genetic algorithm were obtained. The results
indicate that:the calculation time of the greedy algorithm is only 3 seconds,which is much faster than the genetic algorithm
in obtaining solutions;the total completion time,total equipment waiting time and average loader waiting time of greedy
combination strategies ③&⑥ were the shortest compared with other combination strategies,and the equipment production capacity
was also the strongest. Therefore,the greedy algorithm combined with strategies 3&6 can be used to solve multi-type and
multi-equipment collaborative scheduling problems,and it can quickly obtain the optimal collaborative scheduling scheme,improve
equipment time utilization,and reduce production costs.

Key words: underground mine,multi-equipment scheduling,waiting time,greedy algorithm,optimization