A local branching heuristic for the open pit mine production scheduling problem
type: Item
instance of: scholarly article
title: A local branching heuristic for the open pit mine production scheduling problem
zbMATH Open document ID: 1394.90303
author: Mehran Samavati
author: Micah Nehring
author: Daryl Essam
author: Ruhul Sarker
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 6872926
zbMATH Keywords: open pit mine production scheduling
zbMATH Keywords: minimum resource requirements
zbMATH Keywords: local branching
zbMATH Keywords: heuristics
describes a project that uses: MineLib
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.07.004
OpenAlex ID: W2471320409
cites work: Global optimization using special ordered sets
cites work: Solving LP Relaxations of Large-Scale Precedence Constrained Problems
cites work: LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
cites work: An application of branch and cut to open pit mine scheduling
cites work: A New Algorithm for the Open-Pit Mine Production Scheduling Problem
cites work: A sliding time window heuristic for open pit mine block sequencing
cites work: MineLib: a library of open pit mining problems
cites work: Local branching
cites work: A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
cites work: Variable neighborhood search and local branching
cites work: Aggregation heuristic for the open-pit block scheduling problem
cites work: Tailored Lagrangian relaxation for the open pit block sequencing problem
cites work: Q3103879
cites work: Large-scale multi-period precedence constrained knapsack problem: a mining application
cites work: The new Fundamental Tree Algorithm for production scheduling of open pit mines
cites work: A local branching heuristic for the capacitated fixed-charge network design problem
cites work: Long term production planning of open pit mines by ant colony optimization
cites work: A mathematical programming viewpoint for solving the ultimate pit problem
cites work: A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
DOI: 10.1016/J.EJOR.2016.07.004
description: scientific article; zbMATH DE number 6872926