Aggregation heuristic for the open-pit block scheduling problem
From MaRDI portal
Publication:321137
DOI10.1016/j.ejor.2015.10.044zbMath1346.90307OpenAlexW2203492501MaRDI QIDQ321137
Patricio Reyes, Nelson Morales, Enrique Jélvez, Pierre Nancel-Penard, Juan Peypouquet
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/228458
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (11)
Concurrent open-pit mine production and in-pit crushing–conveying system planning ⋮ 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 ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Effective solution of the long-term open pit production planning problem using block clustering ⋮ Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach ⋮ Solution procedures for block selection and sequencing in flat-bedded potash underground mines ⋮ A local branching heuristic for the open pit mine production scheduling problem ⋮ Linear models for stockpiling in open-pit mine production scheduling problems ⋮ Comparative analysis of three metaheuristics for short-term open pit block sequencing ⋮ Optimizing a mineral value chain with market uncertainty using Benders decomposition
Uses Software
Cites Work
- Unnamed Item
- MineLib: a library of open pit mining problems
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- A continuous framework for open pit mine planning
- 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
- An application of branch and cut to open pit mine scheduling
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- A New Algorithm for the Open-Pit Mine Production Scheduling Problem
- Variable neighborhood search: Principles and applications
This page was built for publication: Aggregation heuristic for the open-pit block scheduling problem
