A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines

DOI10.1007/s10898-014-0185-zzbMath1326.90026OpenAlexW1965868850WikidataQ59433925 ScholiaQ59433925MaRDI QIDQ887202

Jacques A. Ferland, Amina Lamghari, Roussos Dimitrakopoulos

Publication date: 28 October 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0185-z

zbMATH Keywords

schedulinghybrid methodsvariable neighborhood descentopen-pit mine planning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (6)

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 ⋮ Evolutionary approach for large-scale mine scheduling ⋮ Constructing branching trees of geostatistical simulations ⋮ A dynamic-material-value-based decomposition method for optimizing a mineral value chain with uncertainty ⋮ Hyper-heuristic approaches for strategic mine planning under uncertainty ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem

Uses Software

• AMPL
• CPLEX
• MineLib

Cites Work

• Unnamed Item
• MineLib: a library of open pit mining problems
• 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
• An application of branch and cut to open pit mine scheduling
• A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
• A strengthened formulation and cutting planes for the open pit mine production scheduling problem
• Large-scale multi-period precedence constrained knapsack problem: A mining application
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• Solving LP Relaxations of Large-Scale Precedence Constrained Problems
• The Problem Of Production Planning In Open Pit Mines
• A New Algorithm for the Open-Pit Mine Production Scheduling Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines