An application of branch and cut to open pit mine scheduling
From MaRDI portal
Publication:1407258
DOI10.1023/A:1024835022186zbMath1033.90035OpenAlexW1534941005MaRDI QIDQ1407258
Louis Caccetta, Stephen P. Hill
Publication date: 15 September 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024835022186
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (34)
Large-scale multi-period precedence constrained knapsack problem: A mining application ⋮ On the directed cut cone and polytope ⋮ Optimality conditions for the continuous model of the final open pit problem ⋮ An integrated approach for earthwork allocation, sequencing and routing ⋮ 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 ⋮ Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve 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 ⋮ A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty ⋮ A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Optimal control approaches for open pit planning ⋮ A continuous framework for open pit mine planning ⋮ Clique-based facets for the precedence constrained knapsack problem ⋮ Strategic planning of an underground mine with variable cut-off grades ⋮ Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach ⋮ Tailored Lagrangian relaxation for the open pit block sequencing problem ⋮ A dynamic-material-value-based decomposition method for optimizing a mineral value chain with uncertainty ⋮ A local branching heuristic for the open pit mine production scheduling problem ⋮ Linear models for stockpiling in open-pit mine production scheduling problems ⋮ LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity ⋮ Comparative analysis of three metaheuristics for short-term open pit block sequencing ⋮ Optimizing a mineral value chain with market uncertainty using Benders decomposition ⋮ A sliding time window heuristic for open pit mine block sequencing ⋮ A MIXED-INTEGER LINEAR PROGRAMMING (MILP) MODEL FOR SHORT-RANGE PRODUCTION SCHEDULING OF CEMENT QUARRY OPERATIONS ⋮ A strengthened formulation and cutting planes for the open pit mine production scheduling problem ⋮ Receding horizon control applied to optimal mine planning ⋮ A two-step approach to incorporate cut-off grade and stockpiling in oil sands mine planning optimization framework ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing
This page was built for publication: An application of branch and cut to open pit mine scheduling
