Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach
From MaRDI portal
Publication:5144773
DOI10.1287/opre.2019.1965zbMath1455.90069OpenAlexW3080183836MaRDI QIDQ5144773
Gonzalo Muñoz, Eduardo Moreno, Marcos Goycoolea, Orlando Rivera Letelier, Daniel G. Espinoza
Publication date: 19 January 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1965
heuristicsproduction schedulingcolumn generationcutting planesopen pit mininginteger programming applications
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A framework for adaptive open-pit mining planning under geological uncertainty ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem ⋮ Constructing branching trees of geostatistical simulations ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Solution procedures for block selection and sequencing in flat-bedded potash underground mines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Aggregation heuristic for the open-pit block scheduling problem
- Production scheduling with uncertain supply: a new solution to the open pit mining problem
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- The precedence constrained knapsack problem: separating maximally violated inequalities
- A sliding time window heuristic for open pit mine block sequencing
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- Polyhedral results for the precedence-constrained knapsack problem
- An application of branch and cut to open pit mine scheduling
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- Optimizing the open pit-to-underground mining transition
- Linear models for stockpiling in open-pit mine production scheduling problems
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing
- Optimizing Long-Term Production Plans in Underground and Open-Pit Copper Mines
- A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
- Decomposition Principle for Linear Programs
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems
- A New Algorithm for the Open-Pit Mine Production Scheduling Problem
