LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
From MaRDI portal
Publication:958440
DOI10.1016/j.cor.2007.12.006zbMath1162.90446OpenAlexW2130796978WikidataQ59139586 ScholiaQ59139586MaRDI QIDQ958440
Irina Dumitrescu, Ambros M. Gleixner, Gary Froyland, Natashia Boland
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.12.006
aggregationmixed integer programmingnet present valueopen pit miningconstrained scheduling problemsiterative disaggregation
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items
An integrated approach for earthwork allocation, sequencing and routing ⋮ Medium range optimization of copper extraction planning under uncertainty in future copper prices ⋮ Optimization-based heuristics for underground mine scheduling ⋮ Long term production planning of open pit mines by ant colony optimization ⋮ Concurrent open-pit mine production and in-pit crushing–conveying system planning ⋮ Aggregation heuristic for the open-pit block scheduling problem ⋮ Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty ⋮ 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 ⋮ MineLib: a library of open pit mining problems ⋮ Evolutionary approach for large-scale mine scheduling ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem ⋮ A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines ⋮ Constructing branching trees of geostatistical simulations ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach ⋮ Tailored Lagrangian relaxation for the open pit block sequencing problem ⋮ The precedence constrained knapsack problem: separating maximally violated inequalities ⋮ A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling ⋮ A local branching heuristic for the open pit mine production scheduling problem ⋮ Linear models for stockpiling in open-pit mine production scheduling problems ⋮ Optimizing a mineral value chain with market uncertainty using Benders decomposition ⋮ A sliding time window heuristic for open pit mine block sequencing ⋮ A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine ⋮ A hybrid heuristic algorithm for the open-pit-mining operational planning problem ⋮ Open pit mine planning with degradation due to stockpiling ⋮ Hyper-heuristic approaches for strategic mine planning under uncertainty ⋮ Practical performance of an open pit mine scheduling model considering blending and stockpiling ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing
Uses Software
Cites Work
- The new Fundamental Tree Algorithm for production scheduling of open pit mines
- Convergence aspects of adaptive clustering in variable aggregation
- An application of branch and cut to open pit mine scheduling
- Aggregation in large-scale optimization
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Unnamed Item
- Unnamed Item
