Long-team open-pit production scheduling through dynamic phase-bench sequencing

In this method the state of an open-pit mine is represented by the number of benches that are mined in each predesigned mining phase (or pushback). Consequently, a specific mining schedule can be represented by a sequence of states which starts with the topography of the mine site and ends with the ultimate pit. For a given set of mining phases all feasible states are first generated and sequences of states are then evaluated for technical and economical feasibility. The best sequence, which gives the maximum net present value (NPV), is found by applying a dynamic programming optimisation algorithm. The algorithm also optimises the cut-off grade which satisfies the mill feed requirement for each planning period. It was found that the algorithm can be used not only for scheduling but also as an effective tool for analysing the effects of mining and milling capacities and cut-off constraints on the mining schedule and the total NPV. The algorithm, which was programmed in C, was successfully applied to a large Au-Cu deposit