MineLib: a library of open pit mining problems

DOI10.1007/s10479-012-1258-3zbMath1271.90115WikidataQ57707467 ScholiaQ57707467MaRDI QIDQ363555

Marcos Goycoolea, Eduardo Moreno, Alexandra M. Newman, Daniel G. Espinoza

Publication date: 3 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/127913

zbMATH Keywords

mine planning; mine scheduling; open pit mining library; open pit production scheduling; problem libraries; surface mine production scheduling

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

Related Items

Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining, A real-world mine excavators timetabling methodology in open-pit mining, A model for open-pit pushback design with operational constraints, Short-term open-pit production scheduling optimizing multiple objectives accounting for shovel allocation in stockpiles, MineLib, Aggregation heuristic for the open-pit block scheduling problem, Tailored Lagrangian relaxation for the open pit block sequencing problem, Comparative analysis of three metaheuristics for short-term open pit block sequencing, A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines, Optimizing high-level nuclear waste disposal within a deep geologic repository, A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling, A local branching heuristic for the open pit mine production scheduling problem, Linear models for stockpiling in open-pit mine production scheduling problems, Combined optimisation of an open-pit mine outline and the transition depth to underground mining, 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, Solution procedures for block selection and sequencing in flat-bedded potash underground mines, MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results, A new model for automated pushback selection, Evolutionary approach for large-scale mine scheduling, Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing, A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines

Uses Software

• TSPLIB
• MIPLIB
• OR-Library

Cites Work

• Unnamed Item
• 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 mathematical programming viewpoint for solving the ultimate pit problem
• An application of branch and cut to open pit mine scheduling
• A new?old algorithm for minimum-cut and maximum-flow in closure graphs
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• Solving LP Relaxations of Large-Scale Precedence Constrained Problems
• TSPLIB—A Traveling Salesman Problem Library
• The Problem Of Production Planning In Open Pit Mines
• A New Algorithm for the Open-Pit Mine Production Scheduling Problem
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem