Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...

open-pit production scheduling (opps) problem focuses on determining a block sequencing and scheduling to maximize net present value (npv) of the venture under constraints. the scheduling model is critically sensitive to the economic value volatility of block, block weight, and operational capacity. in order to deal with the opps uncertainties, various approaches can be recommended. robust opti...

Open-Pit Production Scheduling (OPPS) problem focuses on determining a block sequencing and scheduling to maximize Net Present Value (NPV) of the venture under constraints. The scheduling model is critically sensitive to the economic value volatility of block, block weight, and operational capacity. In order to deal with the OPPS uncertainties, various approaches can be recommended. Robust opti...

In an Open-Pit Production Scheduling (OPPS) problem, the goal is to determine the mining sequence of an orebody as a block model. In this article, linear programing formulation is used to aim this goal. OPPS problem is known as an NP-hard problem, so an exact mathematical model cannot be applied to solve in the real state. Genetic Algorithm (GA) is a well-known member of evolutionary algorithms...

This document presents material supplementary to our companion paper A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines. In this companion paper, we consider the short-term production scheduling problem for a network of multiple open-pit mines and ports. Ore produced at each mine is transported by rail to a set of ports and blended into signature product...

We consider the problem of finding an optimal mining sequence for an open pit during a number of time periods subject to only spatial and temporal precedence constraints. This problem is of interest because such constraints are generic to any open-pit scheduling problem and, in particular, because it arises as a Lagrangean relaxation of an open-pit scheduling problem. We show that this multi-pe...

We present an integer programming formulation for the open pit mine production scheduling problem. We strengthen this formulation by adding inequalities derived by combining the precedence and production constraints. The addition of these inequalities decreases the computational requirements to obtain the optimal integer solution, in many cases by a significant margin. & 2010 Elsevier Ltd. All ...

The use of mixed integer programming is a modeling approach well suited to formulate the mine scheduling optimization problem for both open pit and underground mining. The resolution applied for discretizing the problem, however, has a direct effect on both the level of selectivity that can be applied to improve profitability, as well as the computational feasibility. The proposed model allows ...

determination a sequence of extracting ore is one of the most important problems in mine annual production scheduling. production scheduling affects mining performance especially in a poly-metallic open pit mine with considering the imposed operational and physical constraints mandated by high levels of reliability in relation to the obtained actual results. one of the important operational con...