Sequential decomposition algorithm for mine planning with restriction of grades in the feed of the mineral processing plant

The block sequencing problem in open-pit mines is complex due to its combinatorial nature, which makes it challenging to solve using mathematical programming. This work used a sequential decomposition algorithm, in which each period is optimally solved via a mathematical programming-based solver. The method was applied to the Marvin block model from the MineLib library, obtaining a result superior to the best reported value. Subsequently, a constraint was incorporated to reduce the variability of grade in the plant feed. The results show that the algorithm used was able to control the grade, making the scheduling closer to the operational reality of the mines. The code is being made available to enable reproduction and future advancements.