A sliding time window heuristic for open pit mine block sequencing
From MaRDI portal
Publication:691428
DOI10.1007/s11590-011-0306-2zbMath1262.90102OpenAlexW2046010791MaRDI QIDQ691428
Christopher Cullenbine, R. Kevin Wood, Alexandra M. Newman
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0306-2
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An integrated approach for earthwork allocation, sequencing and routing, Optimization-based heuristics for underground mine scheduling, Multi-objective short-term production scheduling for open-pit mines: a hierarchical decomposition-based algorithm, Concurrent open-pit mine production and in-pit crushing–conveying system planning, Aggregation heuristic for the open-pit block scheduling problem, Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty, 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, MineLib: a library of open pit mining problems, Evolutionary approach for large-scale mine scheduling, A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines, Constructing branching trees of geostatistical simulations, A real-world mine excavators timetabling methodology in open-pit mining, An efficient method for optimizing nested open pits with operational bottom space, A model for open-pit pushback design with operational constraints, Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach, Tailored Lagrangian relaxation for the open pit block sequencing problem, The precedence constrained knapsack problem: separating maximally violated inequalities, A local branching heuristic for the open pit mine production scheduling problem, Comparative analysis of three metaheuristics for short-term open pit block sequencing, Hyper-heuristic approaches for strategic mine planning under uncertainty, Practical performance of an open pit mine scheduling model considering blending and stockpiling, Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing
Uses Software
Cites Work
- 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
- Vehicles scheduling with sliding time windows
- An application of branch and cut to open pit mine scheduling
- A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Problem Of Production Planning In Open Pit Mines
- A New Algorithm for the Open-Pit Mine Production Scheduling Problem
