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

Authors:
Andreas Bley;Natashia Boland;Christopher Fricke;Gary Froyland
Affiliations:
Technische Universität Berlin, Straíe des 17. Juni 136, 10623 Berlin, Germany;School of Mathematical and Physical Sciences, University of Newcastle, Callaghan NSW 2308, Australia;TSG Consulting, Level 11, 350 Collins Street, Melbourne, VIC 3000, Australia;School of Mathematics and Statistics, University of New South Wales, Sydney, NSW 2052, Australia
Venue:
Computers and Operations Research
Year:
2010

Citing 5
Cited 3

Polyhedral results for the precedence-constrained knapsack problem

Discrete Applied Mathematics
Lifting cover inequalities for the precedence-constrained knapsack problem

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Application of Branch and Cut to Open Pit Mine Scheduling

Journal of Global Optimization
Partially ordered knapsack and applications to scheduling

Discrete Applied Mathematics

A Review of Operations Research in Mine Planning

Interfaces
A New Algorithm for the Open-Pit Mine Production Scheduling Problem

Operations Research
Integration of reclamation and tailings management in oil sands surface mine planning

Environmental Modelling & Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.