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.005MaRDI QIDQ2160495zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicsinteger programmingtime decompositionmultidimensional and multiperiod precedence-constrained knapsack problemopen pit mine scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

Cites work

• A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
• A local branching heuristic for the open pit mine production scheduling problem
• A new algorithm for the open-pit mine production scheduling problem
• A sliding time window heuristic for open pit mine block sequencing
• A strengthened formulation and cutting planes for the open pit mine production scheduling problem
• Aggregation heuristic for the open-pit block scheduling problem
• An application of branch and cut to open pit mine scheduling
• Hierarchical benders decomposition for open-pit mine block sequencing
• LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
• Large-scale multi-period precedence constrained knapsack problem: a mining application
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• MineLib: a library of open pit mining problems
• Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
• Simplifications and speedups of the pseudoflow algorithm
• Solving LP relaxations of large-scale precedence constrained problems
• Tailored Lagrangian relaxation for the open pit block sequencing problem
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Cited in

(3)

• A real-world mine excavators timetabling methodology in open-pit mining
• A sliding time window heuristic for open pit mine block sequencing
• Aggregation heuristic for the open-pit block scheduling problem

Describes a project that uses

Uses Software

• MineLib

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)