A zero-one integer programming model for open pit mining sequences - Synopsis

The aim of short-term production scheduling is to decide which blocks of ore and waste to mine in which time period (shift, days, weeks or months) so that several operational and geometrical constraints can be satisfied simultaneously. Since 1960s several mathematical programming approaches were developed for solving production scheduling problems that are based on a combination of various operational research approaches such as linear programming (LP), integer programming (IP), dynamic programming (DP), etc. A number of models have been developed in the past three decades but some models have limited application especially to geometrical mining constraints. One of the geometrical constraints is block accessibility. All blocks must be accessible to mining equipments on the same bench. In this paper a binary integer programming model is developed in order to incorporate block accessibility constraints in an efficient manner. This mathematical model insures that each block has been open and can be loaded and transported easily by shovels and trucks.