Mine Productivity Upper Bounds and Truck Dispatch Rules

This paper proposes an upper bound for mine productivity and also a simple truck dispatch rule that demonstrates how tight the upper bound can be using simulation. It also proposes a greedy search to approximate the productivity upper bound, which is faster and often exact. Uncertainty is added to the simulation in order to verify how the productivity responds to it. Typically, the productivity upper bound is less tight close to its saturation point as a function of the number of trucks, where adding more trucks only increases queues. Furthermore, more uncertainty in the model typically leads to a less tight upper bound. The results are conducted using real data from an open pit mine in Brazil.