MineLib: a library of open pit mining problems

DOI10.1007/s10479-012-1258-3zbMath1271.90115OpenAlexW2065332058WikidataQ57707467 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 planningmine schedulingopen pit mining libraryopen pit production schedulingproblem librariessurface mine production scheduling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (23)

Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ Aggregation heuristic for the open-pit block scheduling problem ⋮ 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 Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines ⋮ A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Optimal control approaches for open pit planning ⋮ An efficient method for optimizing nested open pits with operational bottom space ⋮ Optimizing high-level nuclear waste disposal within a deep geologic repository ⋮ 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 ⋮ Tailored Lagrangian relaxation for the open pit block sequencing problem ⋮ A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling ⋮ 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 ⋮ Combined optimisation of an open-pit mine outline and the transition depth to underground mining ⋮ Comparative analysis of three metaheuristics for short-term open pit block sequencing ⋮ MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results ⋮ A new model for automated pushback selection ⋮ MineLib ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing

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

This page was built for publication: MineLib: a library of open pit mining problems