A strengthened formulation and cutting planes for the open pit mine production scheduling problem

We present an integer programming formulation for the open pit mine production scheduling problem. We strengthen this formulation by adding inequalities derived by combining the precedence and production constraints. The addition of these inequalities decreases the computational requirements to obtain the optimal integer solution, in many cases by a significant margin.