Tailored Lagrangian relaxation for the open pit block sequencing problem

DOI10.1007/s10479-012-1287-yzbMath1303.90068OpenAlexW1969268769MaRDI QIDQ490234

Yong-Cai Geng, Sumit K. Garg

Publication date: 22 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10479-012-1287-y

zbMATH Keywords

integer programmingproduction schedulingmining

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Concurrent open-pit mine production and in-pit crushing–conveying system planning ⋮ 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 ⋮ Optimizing high-level nuclear waste disposal within a deep geologic repository ⋮ Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach ⋮ 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 ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing

Uses Software

• AMPL
• CPLEX
• MineLib

Cites Work

• Unnamed Item
• MineLib: a library of open pit mining problems
• Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow 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
• A mathematical programming viewpoint for solving the ultimate pit problem
• 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
• A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine
• Large-scale multi-period precedence constrained knapsack problem: A mining application
• Solving LP Relaxations of Large-Scale Precedence Constrained Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A New Algorithm for the Open-Pit Mine Production Scheduling Problem
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Production Planning by Mixed Integer Programming

This page was built for publication: Tailored Lagrangian relaxation for the open pit block sequencing problem