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
DOI10.1016/J.EJOR.2022.04.005OpenAlexW4225843188MaRDI QIDQ2160495FDOQ2160495
Authors: Pierre Nancel-Penard, Nelson Morales, Fabien Cornillier 
Publication date: 3 August 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.04.005
Recommendations
- Large-scale multi-period precedence constrained knapsack problem: a mining application
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- A new algorithm for the open-pit mine production scheduling problem
- A sliding time window heuristic for open pit mine block sequencing
- Aggregation heuristic for the open-pit block scheduling problem
heuristicsinteger programmingtime decompositionmultidimensional and multiperiod precedence-constrained knapsack problemopen pit mine scheduling
Cites Work
- MineLib: a library of open pit mining problems
- An application of branch and cut to open pit mine scheduling
- Solving LP relaxations of large-scale precedence constrained problems
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- A new algorithm for the open-pit mine production scheduling problem
- 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
- A local branching heuristic for the open pit mine production scheduling problem
- Aggregation heuristic for the open-pit block scheduling problem
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- Large-scale multi-period precedence constrained knapsack problem: a mining application
- Hierarchical benders decomposition for open-pit mine block sequencing
- Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
- A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
- Simplifications and speedups of the pseudoflow algorithm
Cited In (3)
Uses Software
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160495)
