A strengthened formulation for the open pit mine production scheduling problem

We present a strengthened integer programming formulation for the open pit mine production scheduling problem, where the precedence and production constraints are combined to form 0-1 knapsack inequalities. Addition of corresponding knapsack cover inequalities decreases the computational requirements to obtain the optimal integer solution, in many cases by a significant margin.

Citation

The University of Melbourne, Parkville, VIC 3010, Australia, 27th June 2006

Article

Download

View A strengthened formulation for the open pit mine production scheduling problem