A local branching heuristic for the open pit mine production scheduling problem

DOI10.1016/j.ejor.2016.07.004zbMath1394.90303OpenAlexW2471320409MaRDI QIDQ1752798

Micah Nehring, Mehran Samavati, Ruhul A. Sarker, Daryl L. Essam

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.004

zbMATH Keywords

heuristicslocal branchingminimum resource requirementsopen pit mine production scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

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, A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem, Production planning and scheduling in mining scenarios under IPCC mining systems

Uses Software

• MineLib

Cites Work

• Unnamed Item
• Long term production planning of open pit mines by ant colony optimization
• Aggregation heuristic for the open-pit block scheduling problem
• MineLib: a library of open pit mining problems
• Tailored Lagrangian relaxation for the open pit block sequencing problem
• A sliding time window heuristic for open pit mine block sequencing
• The new Fundamental Tree Algorithm for production scheduling of open pit mines
• LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
• A local branching heuristic for the capacitated fixed-charge network design problem
• A mathematical programming viewpoint for solving the ultimate pit problem
• An application of branch and cut to open pit mine scheduling
• Local branching
• Variable neighborhood search and local branching
• Large-scale multi-period precedence constrained knapsack problem: A mining application
• A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
• A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
• Solving LP Relaxations of Large-Scale Precedence Constrained Problems
• Global optimization using special ordered sets
• A New Algorithm for the Open-Pit Mine Production Scheduling Problem