多步调度模型的效力依赖于实施产量最大化及品位控制目标的实时调度算法的能力。提出实时调度的一种运输算法，给出它的推导、开发及验证。这个算法是按照使每个电铲线路的累计产量与目标的偏差最小的原则来确定贫铲；按照使汽车与电铲的总等待时间为最少的原则给贫铲分配汽车的。还探讨了该调度系统对电铲及汽车故障的反应能力。本算法使产量有大幅度的增长，而且即使在电铲故障的情况下，也能使各种矿石品位的运行平均值仍接近目标。 The effectiveness of the multi-step scheduling model relies on the ability to implement real-time scheduling algorithms that maximize throughput and grade control objectives. A transport algorithm for real-time scheduling is proposed, and its derivation, development and verification are given. This algorithm determines the poor shovel based on the principle of minimizing the deviation between the cumulative output of each shovel line and the target and allocates the car to the shovel according to the principle of minimizing the total waiting time for the car and power shovel. The scheduling system’s response to power shovels and car malfunctions is also explored. The algorithm allows a substantial increase in production and, even in the case of a power shovel failure, enables the running averages of various ore grades to be close to the target.