Linear models for stockpiling in open-pit mine production scheduling problems

2017 ◽  
Vol 260 (1) ◽  
pp. 212-221 ◽  
Author(s):  
Eduardo Moreno ◽  
Mojtaba Rezakhah ◽  
Alexandra Newman ◽  
Felipe Ferreira
Keyword(s):  
Production Scheduling ◽  
Linear Models ◽  
Open Pit Mine ◽  
Open Pit ◽  
Scheduling Problems ◽  
Mine Production ◽  
Mine Production Scheduling

A local branching heuristic for the open pit mine production scheduling problem

2017 ◽  
Vol 257 (1) ◽  
pp. 261-271 ◽  
Author(s):  
Mehran Samavati ◽  
Daryl Essam ◽  
Micah Nehring ◽  
Ruhul Sarker
Keyword(s):  
Production Scheduling ◽  
Open Pit Mine ◽  
Open Pit ◽  
Scheduling Problem ◽  
Local Branching ◽  
Mine Production ◽  
Mine Production Scheduling

Improving performance of open-pit mine production scheduling problem under grade uncertainty by hybrid algorithms

2020 ◽  
Vol 27 (9) ◽  
pp. 2479-2493
Author(s):  
Kamyar Tolouei ◽  
Ehsan Moosavi ◽  
Amir Hossein Bangian Tabrizi ◽  
Peyman Afzal ◽  
Abbas Aghajani Bazzazi
Keyword(s):  
Production Scheduling ◽  
Hybrid Algorithms ◽  
Open Pit Mine ◽  
Open Pit ◽  
Scheduling Problem ◽  
Mine Production ◽  
Mine Production Scheduling ◽  
Grade Uncertainty

A simulated annealing based approach for open pit mine production scheduling with stockpiling option

2021 ◽  
Vol 71 ◽  
pp. 102016
Author(s):  
Abid Ali Khan Danish ◽  
Asif Khan ◽  
Khan Muhammad ◽  
Waqas Ahmad ◽  
Saad Salman
Keyword(s):  
Simulated Annealing ◽  
Production Scheduling ◽  
Open Pit Mine ◽  
Open Pit ◽  
Mine Production ◽  
Mine Production Scheduling

scholarly journals Production Scheduling of Open Pit Mine Using Sequential Branch-and-Cut and Longest Path Algorithm: An Application from an African Copper Mine

2020 ◽  
Vol 53 (5) ◽  
pp. 629-636
Author(s):  
Devendra Joshi ◽  
Susanta Kumar Satpathy
Keyword(s):  
Production Scheduling ◽  
Feasible Solution ◽  
Resource Constraints ◽  
Open Pit Mine ◽  
Branch And Cut ◽  
Open Pit ◽  
Computational Time ◽  
Mine Production ◽  
Mine Production Scheduling ◽  
Longest Path

Open pit mine production scheduling assigns mining blocks in different production periods for maximising profits after satisfying geotechnical and operational constraints. In this paper, two Open pit mine production scheduling models were applied in an African copper deposit. The first model is a traditional model with more tight resource constraints; the second model is a more robust model where resource constraints are relaxed by penalizing the objective function. Both the models were solved using two step algorithms: (a) year wise production scheduling using a sequential branch-and-cut algorithm; and (b) an iterative longest path algorithm to improve the solution generated from branch-and-cut. Results demonstrated that due to the tight constraints in Model 1, the optimizer was unable to generate a feasible solution after the first period, therefore the lower limit metal production constraint was eliminated to generate a feasible solution; however, Model 2 was able to generate a feasible solution for all periods. Results show that both the models generated nearly the same amount of ore, waste, metal content, and mine life. Model 2 generates relatively more net present value as compared to Model 1, whereas, the computational time required for solving the scheduling problem is relatively less for Model 1 than for Model 2.

A strengthened formulation and cutting planes for the open pit mine production scheduling problem

2010 ◽  
Vol 37 (9) ◽  
pp. 1641-1647 ◽  
Author(s):  
Andreas Bley ◽  
Natashia Boland ◽  
Christopher Fricke ◽  
Gary Froyland
Keyword(s):  
Production Scheduling ◽  
Cutting Planes ◽  
Open Pit Mine ◽  
Open Pit ◽  
Scheduling Problem ◽  
Mine Production ◽  
Mine Production Scheduling
Sign in / Sign up

Export Citation Format

Share Document