A strengthened formulation and cutting planes for the open pit mine production scheduling problem
From MaRDI portal
Publication:2270449
Recommendations
- Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
- A new algorithm for the open-pit mine production scheduling problem
- An application of branch and cut to open pit mine scheduling
- Linear models for stockpiling in open-pit mine production scheduling problems
- The Problem Of Production Planning In Open Pit Mines
Cites work
- An application of branch and cut to open pit mine scheduling
- Clique-based facets for the precedence constrained knapsack problem
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1754642 (Why is no real title available?)
- scientific article; zbMATH DE number 913714 (Why is no real title available?)
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Lifting valid inequalities for the precedence constrained knapsack problem
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Partially ordered knapsack and applications to scheduling
- Polyhedral results for the precedence-constrained knapsack problem
- Routing and capacity optimization for IP networks
Cited in
(31)- An application of branch and cut to open pit mine scheduling
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers
- 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
- Strategic planning of an underground mine with variable cut-off grades
- Solution procedures for block selection and sequencing in flat-bedded potash underground mines
- Open pit mine planning with degradation due to stockpiling
- Hyper-heuristic approaches for strategic mine planning under uncertainty
- Practical performance of an open pit mine scheduling model considering blending and stockpiling
- Evolutionary approach for large-scale mine scheduling
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- Large-scale multi-period precedence constrained knapsack problem: a mining application
- Long term production planning of open pit mines by ant colony optimization
- 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
- Clique-based facets for the precedence constrained knapsack problem
- A new algorithm for the open-pit mine production scheduling problem
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- The precedence constrained knapsack problem: separating maximally violated inequalities
- 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
- Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
- A real-world mine excavators timetabling methodology in open-pit mining
- A model for open-pit pushback design with operational constraints
- A continuous framework for open pit mine planning
- A direct block scheduling model considering operational space requirement for strategic open-pit mine production planning
- New cutting planes for open-pit mine scheduling with multi-period block extraction
- Optimality conditions for the continuous model of the final open pit problem
- The new Fundamental Tree Algorithm for production scheduling of open pit mines
- A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
This page was built for publication: A strengthened formulation and cutting planes for the open pit mine production scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270449)
