A robust mixed integer linear programming framework for underground cut-and-fill mining production scheduling

Abstract

A review of general optimization studies that have been proposed for underground mining shows that previous works lack flexibility, operability and practicality in relation to cut-and-fill mining production scheduling. This paper presents a robust mixed integer linear programming (MILP) formulation for underground cut-and-fill mining. The objective function of the model is to maximize the net present value (NPV) of the operation while meeting all mining and processing operational and technical constraints. The MILP model features stope development and extraction sequencing constraints, mining and processing tonnage fluctuation constraints, and extraction duration and active levels control constraints. These features make the model more practical and expandable. The MILP model is verified and validated with two case studies from an existing mine and the results are compared with the actual mining strategy. The comparison shows a 9% to 17% improved NPV in both case studies resulting from mining higher grades and processing less tonnes thereby generating a better cash flow.