versión impresa ISSN 0038-223X
J. S. Afr. Inst. Min. Metall. v.112 n.7 Johannesburg jul. 2012
M.W.A. Asad; R. Dimitrakopoulos
COSMO - Stochastic Mine Planning Laboratory, Department of Mining and Materials Engineering, McGill University, Montreal, Quebec, Canada
The optimal design of production phases and ultimate pit limit for an open pit mining operation may be generated using conventional or stochastic approaches. Unlike the conventional approach, the stochastic framework accounts for expected variability and uncertainty in metal content by considering a set of equally probable realizations (models) of the orebody. This paper evaluates the performance of a new stochastic network flow approach for the development of optimal phase design and ultimate pit limit using a gold deposit as the case study. The stochastic and conventional frameworks as considered here utilize the maximum flow and Lerchs-Grossman (LG) algorithms, respectively. The LG algorithm is restricted to considering an estimated (average-type) orebody model, while the stochastic maximum flow algorithm is developed to simultaneously use a set of simulated orebody realizations as an input. The case study demonstrates that, when compared to the conventional LG algorithm as used in the industry, the stochastic approach generates a 30 per cent increase in discounted cash flow, a 21 per cent larger ultimate pit limit, and about 7 per cent more metal, while it maintains a consistency in phase size.
Keywords: open pit mine optimization, maximum flow algorithm, Lerchs-Grossman algorithm.
An orebody model constitutes a three-dimensional accumulation of mining units (blocks). The available metal content in a mining unit and the economic parameters, such as metal price, mining cost, processing cost, marketing or selling cost, as well as the metallurgical recovery, are used to calculate the economic value of a particular mining block. A mining block with a positive value is classified as an ore block, while a mining block with a negative value is identified as a waste block. Usually, an orebody model consists of millions of blocks, and the economic value of these blocks becomes the basic input for the development of the optimal production phase design and determination of the optimal ultimate pit limit1.
An optimal phase design refers to the sequence of extraction that reaches the ultimate pit limit or the extent of extraction2. It is well established that the phase design and ultimate pit limit may be accomplished using conventional and stochastic approaches3,4. The conventional optimization approaches may not account for the expected variations or uncertainty in all pertinent inputs, assuming that inputs (grade or metal content) of mining blocks and all other parameters are constant and in fact the actual values. More specifically, conventional optimization methods consider input from an estimated 'average'-type representation of the orebody model5,6. However, the utilization of the estimated block values may result in an unrealistic mine design and production schedules, leading to the possible failure of capital-intensive mining projects7,8. The stochastic approach, on the other hand, quantifies the inherent uncertainty in geological parameters (grade or metal content), anticipating the possibility of a block incorrectly identified as an ore block, thus accounting for and managing risk in the possible economic value at the time of extraction. Stochastic optimization in mine planning considers a set of simulated realizations of the orebody as an input9-12, and each of these realizations constitutes economic values of mining blocks of its own.
Generally, optimization of production phase design and ultimate pit limit may be described by a directed graph13, represented as G = (N, A). A mining block i carrying a value Vi is represented as a node in N. Also, an arc directed from node i to node i' exists in A, representing the extraction precedence of block i' over block i. The solution to this graph problem maximizes Σi∈N Vi by finding a set N'QN that contains all predecessors related to the nodes with the maximum value. Here, N is referred as the maximum closure on the graph, which in practice corresponds to the ultimate pit limit or a phase within the ultimate pit limit14. The mathematical formulation of this graph problem is given as15,16
where the binary variable x¡ represents a block i. Its value is equal to 1 if block i is inside the pit (or closure) and 0 otherwise. Also Hi represents the set of predecessors of block i.
Conventional optimization models such as the Whittle software17 solve the graph problem (Equations [1-3]) using the Lerchs-Grossman (LG) algorithm18. Johnson19 proposes the maximum flow algorithm as an alternative to the LG algorithm for finding the optimal ultimate pit limit. Unlike the LG algorithm, the structure of the maximum flow algorithm permits the consideration of a set of orebody realizations as an input20. As such, the stochastic optimization models20,21 implement the maximum flow algorithm to solve the graph problem. A review of other stochastic optimization models is given in Dimitrakopoulos22.
This paper describes the comparative analysis of conventional open pit mine optimization implementing the LG algorithm and the stochastic optimization based on the maximum flow algorithm. More specifically, the paper establishes the difference in structure of the LG and maximum flow algorithms, and then uses a gold deposit to demonstrate the value of the stochastic network flow approach that incorporates uncertainty in metal content into open pit mine design.
We first present an overview of pertinent conventional and stochastic optimization models; continue with the application of both the LG and maximum flow algorithms at gold deposit; and discuss the performance of both approaches using phase-wise risk profiles for forecasting cash flows, metal content, and stripping ratio. Conclusions are then presented.
Overview of pertinent conventional and stochastic approaches
The conventional approach considered herein implements the most widely used LG algorithm. Hustrulid and Kuchta23 explain the details of the LG algorithm through step-by-step examples. The calculation of the economic value of mining blocks is prerequisite to the application of the LG algorithm and the value of a particular block i may be calculated as follows:
where P is the metal price, s is the selling cost, g is the grade of block i, y is the metallurgical recovery, c is the processing cost, m is the mining cost, and Qi is the quantity of material in block i. Subsequent to calculation of vi in Equation , to cater for the blocks that are mined, but classified as waste and incur mining cost only, v¡ may be adjusted as follows:
The LG algorithm takes the orebody model containing the block location and corresponding value vi as an input and develops an optimal ultimate pit limit. However, a parametric implementation of the LG algorithm develops phase design, which requires a change in the block value by increasing or decreasing a parameter of interest, λ, usually metal price24. As such, the block value may be modified using vi (λ)=αλ-β, where a represents revenue parameters such as metal price and β represents cost parameters like mining or processing cost. It is evident that a particular value of λ increases or decreases metal price, which results in an ultimate increase or decrease in the block value vi. Equations [1-3] may be modified to incorporate parametric implementation of the LG algorithm
Equations [6-8] generate 'nested pit shells' that are used to develop production phases within the ultimate pit limit. Therefore, the conventional approach achieves the phase design and ultimate pit limit in two separate steps. The first step requires repeat computation with a range of λ values, selected through trial and error, resulting in a series of nested pits. The second step utilizes these nested pit shells to develop a number of phases within the ultimate pit. The approaches of Francois-Bongarcon and Guibal25 and Wang and Sevim26 are amongst the well-known variations of pit parameterization addressing the generation of an optimal phase design and ultimate pit limit.
The stochastic approach considered herein is based on extending the maximum flow algorithms. Hochbaum28 indicates that the graph problem (Equations [1-3]) is a dual of the maximum flow problem i.e. minimum cut problem. Picard29 suggests the conversion of the graph problem into a related graph by adding a source node s and a sink node t and implementing the minimum cut algorithm to solve this related graph for developing the maximum closure i.e. the ultimate pit limit. Meagher et al.20 propose a theoretical background to utilize the minimum cut algorithm in a stochastic framework incorporating multiple realizations of the simulated orebody models for developing both phase design and the ultimate pit limit. Asad and Dimitrakopoulos21 propose an extension in Meagher et al.20 and augment the graph problem with a pit production capacity constraint, which is given as follows:
where M is the mining or pit production capacity.
It is evident that the inclusion of Equation  violates the classical structure of the graph problem (Equations -). Therefore, Asad and Dimitrakopoulos21 integrate the Lagrangian relaxation of the production capacity constraint as suggested in Tachefine and Soumis15. The modified graph problem is presented as follows:
This procedure allows systematic selection of the l values leading to the development of a number of consistent size phases within the ultimate pit limit in a single step, as opposed to the conventional LG approach. As reflected in the modified graph problem (Equations -), the maximum flow algorithm also requires economic values of mining blocks as an input. Therefore, the calculation of economic values of mining blocks for a stochastic framework entertaining multiple simulated realizations of the orebody may be achieved using a modified Equation  as follows:
where vy is the economic value of block i in realization y that is derived from gy and Qy i.e. the grade and amount of material of block i in realization y, respectively. Accordingly, vy may be adjusted as follows:
Equation  reflects the notion that, unlike the conventional approach, the uncertainty in metal content allows a block to be an ore block in one realization and a waste block in another realization. An update of the problem (Equations [10-12]) for a stochastic framework gives where binary variable xy is equal to 1 if block i in orebody model y is inside the pit, 0 otherwise. Equation  supports this argument by maintaining an arc from a particular block in one orebody model to the same block in another orebody model, ensuring that if this block is included inside the pit, it must remain inside the pit in all orebody realizations. The mathematical formulation in Equations - may be translated into construction of a graph containing nodes and arcs. The related graph suggested in Picard29 consists of five elements:
1. The set of nodes with positive (+v) and negative (-v) values, representing ore and waste blocks, respectively
2. The set of arcs from source s to the nodes with positive value (Equation ). The capacity of these arcs is equal to the absolute value (|+v|) of the node
3. The set of arcs from a node with a negative value to the sink t. The capacity of these arcs is equal to the absolute value (|+v|) of the node (Equation )
4. The set of arcs from a particular block i to blocks i' in nyi, maintaining precedence or slope requirement (Equation ) in all realizations of the orebody models. The capacity of these arcs ∞ is ensuring that if block i is inside the pit, then blocks i' in IIyi- are also inside the pit
5. The set of arcs from block i in one realization to block i in another realization (Equation ), ensuring that if block i is inside the pit in one realization, it remains inside the pit in all realizations.
Figure 1 explains the structure of this related graph. It is evident in the mathematical formulation of the graph problem (Equations [15-18]) and its presentation in Figure 1 that the structure of the graph in the stochastic network flow approach is different from the problem (Equations [6-8] in the conventional LG approach. The following section presents solution to the problems (Equations [6-8] and [15-18]), i.e., the stochastic and conventional frameworks respectively, in an application at a gold deposit.
Case study - gold deposit
The application demonstrates the practical aspects and performance analysis of the maximum flow and LG algorithms in stochastic and conventional frameworks respectively.
Description of the deposit and orebody models
The geological database of the deposit contains 421 drillholes. The holes are placed in an irregular grid of 1161 x 930 m with a spacing varying from 16 to 50 m. The sample spacing varies from 30 cm to several metres leading to 4 046 lithology records and 23 585 gold assay records. This data is then set to 5 m long composites with an average gold (Au) content of 0.61 g/t and a standard deviation of 1.47 g/t.
Given the composite data, a wireframe is developed using an Au cutoff grade equal to 1 .00 g/t, which leads to an average grade of 1.13 g/t and a standard deviation of 3.84 g/t for the samples within this wireframe. The wireframe corresponds to a rock type that is consistent over its entire volume. As such, the density of the material is 2.94 t/m3. With block size of 15 x 15 x 10 m, the wireframe constitutes 10 988 mining blocks on an irregular grid, averaging 6615 t of material per block. Using the data within this wireframe, the direct block simulation method11 is employed to generate 20 simulated grade realizations of the orebody. The uncertainty in metal content is reflected by a variation of the gold grade from one realization of the simulated orebody model to the next. These simulated orebody models become an input for calculating the block economic values to be used for stochastic optimization with network flow algorithm. To develop an estimated or 'average' (e-type model), the grades in simulated orebody models are averaged by block. This e-type model is used for the conventional optimization with the LG algorithm.
Application of the stochastic network flow approach
The stochastic approach utilizes the open-source Goldberg Algorithms available from Microsoft Research30 that solves the graph problem (Equations [15-18]) using the maximum flow algorithm.
Given a set of simulated orebody models and economic parameters, the application in stochastic approach commences with calculation of the economic values of mining blocks. Keeping the quantity of material in each block (Q) at 6 615 t, the metal price (P) at $10.00 per gram of Au, the mining cost (m) at $1.00 per ton of material, the processing cost (c) at $9.00 per ton of ore, the refining or selling cost (r) at $0.05 per gram of Au, and the metallurgical recovery (y) at 95 per cent, the block economic values are calculated using Equations  and .
Knowing economic values of mining blocks, steps outlined in Asad and Dimitrakopoulos21 develop a related graph (as given in Figure 1) and implement the maximum flow algorithm to solve this related graph. Maintaining the slope angle at 45° in all (0° to 360°) azimuths, the mining capacity at 16 Mt, and the processing capacity at 8 Mt, the optimal phase design constitutes five phases leading to the ultimate pit limit. Table I shows a summary of results in terms of quantity of ore, waste, and metal, stripping ratio, cash flows, and the number of blocks inside each phase. Figure 2 presents the horizontal and vertical sections of the optimal phase design and ultimate pit limit with the stochastic network flow approach.
Application of the conventional LG approach
The application in the conventional approach utilizes Whittle 4.3.117,31 (commercial mine design software, referred herein as Whittle) in developing the optimal phase design and ultimate pit limit, in two distinct steps. The first step implements the LG algorithm for the development of a range of nested pit shells. The second step employs the commercially available Milawa Scheduler17,31 to find a combination of nested pit shells for the development of a number of phases within the ultimate pit limit. Knowing the quantity of material in each block and the economic parameters as defined in the stochastic network flow approach, the block economic values are calculated using Equations  and .
During the first step, the process (i) maintains a pit slope angle of 45° along all (0° to 360°) azimuths; (ii) varies the l value from 0.3 to 2.0 for modifying the metal price and block economic values from one pit shell to the next; and (iii) generates 65 nested pit shells, where the 19th pit shell corresponds to the ultimate pit limit at λ = 1.
During the second step, the process: (i) maintains an input of mining and processing capacities at 16 Mt and 8 Mt, respectively; (ii) considers pit shells 1 to 19 to find the optimal combination of pit shells merged into five phases within the ultimate pit limit; and (iii) identifies optimal phase design by merging pit shells 1 to 5 in phase 1, pit shells 6 to 11 in phase 2, pit shells 7 to 15 in phase 3, pit shell 16 into phase 4, and pit shells 17 to 19 in phase 5. Table II shows a summary of results in terms of quantity of ore, waste, and metal, stripping ratio, cash flows, and the number of blocks inside each phase. Figure 3 presents a horizontal and vertical section of the optimal phase design and ultimate pit limit.
Figures 2 and 3 present the horizontal and vertical section views (at identical planes and cross-sections) for stochastic and conventional approaches, respectively. It is evident in Figures 2 and 3 that the optimal phase design and ultimate pit limit are physically different in both stochastic and conventional approaches, used herein. Similarly, Tables I and II show that the stochastic approach targets high-value ore blocks and generates significantly higher worth by mining relatively less valuable material with a high metal content as compared to the conventional approach. Table II also shows that phase 5 generates a negative discounted cash flow. It demonstrates that mining activity should be terminated upon completion of phase 4, which further reduces the quantity of metal from 41 t to 36 t. The optimal phase design with the stochastic approach produces relatively consistently-sized phases due to the systematic selection of l values as compared to the trial-and-error method employed in the conventional approach. The mining and processing capacities have been used as a guideline for maintaining consistency in developing an optimal phase design in both approaches. These capacities do not serve to develop a yearly optimal production schedule; instead, in order to accomplish a valid comparison with the LG approach in Whittle, a mining capacity based phase-wise mining schedule is used to facilitate calculating the discounted value.
Figures 4, 5, and 6 present the comparison of the two approaches in terms of risk profiles for yearly cash flows, metal content, and stripping ratios. It is evident that the conventional approach commits higher returns during initial years due mainly to the size of phase 1 . However, the stochastic network flow approach promises improvement in quality of solutions in terms of an increase in total discounted as well as undiscounted value and total metal content as compared to the conventional LG approach. The structure of the graph in the stochastic approach ensures that more waste blocks may be supported to generate higher overall returns through a large ultimate pit limit. The risk profiles for stripping ratios show that the stochastic network flow approach maintains relatively higher incremental and overall stripping ratios for exposing more valuable material as compared to the conventional LG approach.
This case study verifies that the valuable information contained in multiple realizations of the simulated orebody models, that is, the local joint uncertainty of metal content, is lost by merely averaging the metal content for producing e-type or conventionally estimated single orebody models, which is used subsequently in the conventional optimization approach. The observations herein using stochastic network flow approach, that is, larger ultimate pit limit, and more metal, are consistent with the results of stochastic scheduling approaches based on simulated annealing8,32 and Stochastic Integer Programming (SIP)32-34. Additionally, to establish the relevance of accounting uncertainty in metal content and the effect of using multiple simulated orebody models, we utilized the e-type model in maximum flow algorithm and experienced a 12.41 per cent decrease in the size of the ultimate pit limit (17 243 blocks inside the ultimate pit limit as opposed to 19 686 blocks in stochastic network flow approach) .
This paper presents a performance analysis of the stochastic network flow and conventional LG approaches for developing the optimal phase design and ultimate pit limit for an open pit mine. The outcomes in the case study at a gold deposit show that the stochastic network flow approach performs substantially better by forecasting a 39 per cent and 30 per cent increase in total undiscounted and discounted cash flows, respectively; along with a 21 per cent larger pit (stochastically optimal pit limit), and 7 per cent increase in total metal content as compared to the conventional approach widely practiced in the mining industry.
The case study also (i) highlights the importance of accounting for the expected variability and uncertainty in the available metal content for the optimal pit design; and (ii) demonstrates that the structure of the graph and the Lagrangian relaxation of the production capacity constraints in the stochastic network flow approach generate relatively consistently-sized phases and higher value.
The optimization models used in the case study do not consider uncertainty in the economic parameters, such as metal price, mining and processing cost, and the discount rate. However, a modification in the structure of the related graph in the stochastic network flow approach can further accommodate uncertainty in economic parameters and enable investigation of its implications for optimal pit design.
The work in this paper was funded from NSERC CDR Grant 335696 and BHP Billiton, NSERC Discovery grant 239019 and the members of the COSMO Stochastic Mine Planning Laboratory: AngloGold Ashanti, Barrick, BHP Billiton, De Beers, Newmont, and Vale. Thanks are in order to Brian Baird, Peter Stone, Darren Dyck, and Gavin Yates of BHP Billiton for their support, collaboration, and technical comments.
1. ASKARI-NASAB, H., POURRAHIMIAN, Y., BEN-AWUAH, E.,and KALANTARI, S. Mixed integer linear programming formulations for open pit production scheduling. Journal of Mining Science, vol. 47, no. 3, 2011. pp. 338-359. [ Links ]
2. ELKINGTON, T. and DURHAM, R. Integrated open pit pushback selection and production capacity optimization. Journal of Mining Science, vol. 47, no. 2, 2011. pp. 177-190. [ Links ]
3. NAZAROV, I.V. and KORTELEV, O.B. Modeling anopen pit mine in a multitest statement. Journal of Mining Science, vol. 37, no. 3, 1993. pp. 434-439. [ Links ]
4. BAKHTAVAR, E., SHAHRIAR, K., and ORAEE, K. Transition from open-pit to underground as a new optimization challenge in mining engineering. Journal of Mining Science, vol. 45, no. 5, 2009. pp. 485-494. [ Links ]
5. DAVID, M. Geostatistical Ore Reserve Estimation. Elsevier Scientific Publishing Company, Amsterdam, 1977. [ Links ]
6. DAVID, M. Handbook of Applied Advanced geostatistical ore reserve estimation. Elsevier Science, Amsterdam, 1988. [ Links ]
7. DIMITRAKOPOULOS, R., FARRELLY, C.T., and GODOY, M. Moving forward from traditional optimization: grade uncertainty and risk effects in open pit design. Transactions of the Institute of Mining and Metallurgy (Section A: Mining Technology), vol. 111, 2002. pp. 82-88. [ Links ]
8. GODOY, M.C. and DIMITRAKOPOULOS, R. Managing risk and waste mining in long-term production scheduling. Transactions of the Society of Mining Engineers of AME, vol. 316, 2004. pp. 43-50. [ Links ]
9. GOOVAERTS, P. Geostatistics for Natural Resources Evaluation. Oxford University Press, New York, 1997. pp. 483. [ Links ]
10. BOUCHER, A. Sub-pixel mapping of coarse satellite remote sensing images with stochastic simulations from training images. Mathematical Geosciences, vol. 41, no. 3, 2009. pp. 265-290. [ Links ]
11. BOUCHER, A. and DIMITRAKOPOULOS, R. Block simulation of multiple correlated variables. Mathematical Geosciences, vol. 41, no. 2, 2009. pp. 215-237. [ Links ]
12. HORTA, A. and AMILCAR, S. Direct sequential co-simulation with joint probability distributions. Mathematical Geosciences, vol. 42, no. 3, 2010. pp. 269-292. [ Links ]
13. HOCHBAUM, D.S. and CHEN, A. Performance analysis and best implementations of old and new algorithms for the open-pit mining problem. Operations Research, vol. 48, no. 6, 2000. pp. 894-914. [ Links ]
14. CHANDRAN, B.G. and HOCHBAUM, D.S. A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Operations Research, vol. 57, no. 2, 2009. pp. 358-376. [ Links ]
15. TACHEFINE, B. and SOUMIS, F. Maximal closure on a graph with resource constraints. Computers and Operations Research, vol. 24, no. 10, 1997. pp. 981-990. [ Links ]
16. HOCHBAUM, D.S. Efficient algorithms for the inverse spanning tree problem. Operations Research, vol. 51, no. 5, 2003. pp. 785-797. [ Links ]
17. WHITTLE, J. Beyond optimization in open pit design. Proceedings of the Canadian Conference on Computer Applications in the Mineral Industries, 1988. pp. 331-337. [ Links ]
18. LERCHS, H. and GROSSMANN, I.F. Optimum design of open pit mines. CIM Transactions, vol. 58, 1965. pp. 17-24. [ Links ]
19. JOHNSON, T.B. Optimum open pit mine production scheduling. PhD Thesis, Department of IEOR, University of California, Berkeley, CA, 1968. [ Links ]
20. MEAGHER, C., ABDEL SABOUR, S.A., and DIMITRAKOPOULOS, R. Pushback design of open pit mines under geological and market uncertainties. Australian Institute of Mining and Metallurgy, Perth, Western Australia, 2009. pp. 297-304. [ Links ]
21. ASAD, M.W.A. and DIMITRAKOPOULOS, R. Implementing a parametric maximum flow algorithm for optimal open pit mine design under uncertain supply and demand. Journal of Operational Research Society, 2012 0, pp. 1-13. doi:10.1057/jors.2012.26. [ Links ]
22. DIMITRAKOPOULOS, R. Stochastic optimization for strategic mine planning: A decade of developments. Journal of Mining Science, vol. 47, no. 2, 2011. pp. 138-150. [ Links ]
23. HUSTRULID, W. and KUCHTA, M. Open Pit Mine Planning and Design. 2nd edn. Taylor and Francis/Balkema, The Netherlands, 2006. [ Links ]
24. WHITTLE, J. A decade of open pit mine planning and optimisation - the craft of turning algorithms into packages. Proceedings of the 28th International Symposium on Application of Computers and Operations Research in the Mineral Industry, 1999. pp. 15-24. [ Links ]
25. FRANCOIS-BONGARCON, D. and GUIBAL, D. Parameterization of optimal designs of an open pit - beginning of a new phase of research. Transactions of the Society of Mining Engineers of AIME, vol. 274, 1984. pp. 1801-1805. [ Links ]
26. WANG, Q. and SEVIM, H. An alternative to parameterization in finding a series of maximum-metal pits for production planning. Proceedings of the 24th International Symposium on Application of Computers and Operations Research in the Mineral Industry, 1993. pp. 168-175. [ Links ]
27. GOLDBERG, A.V. and TARJAN, R.E. A new approach to the maximum flow problem. Journal of the Associationfor Computing Machinery, vol. 35, no. 4, 1988. pp. 921-940. [ Links ]
28. HOCHBAUM, D.S. A new-old algorithm for minimum-cut and maximum-flow in closure graphs. Networks, vol. 37, no. 4, 2001. pp. 171-193. [ Links ]
29. PICARD, J.C. Maximal closure of a graph and applications to combinatorial problems. Management Science, vol. 22, no. 11, 1976. pp. 1268-1272. [ Links ]
30. BABENKO, M.A. and GOLDBERG, A.V. Experimental evaluation of a parametric flow algorithm. Microsoft Research Technical Report no. MSR-TR-2006-77, 2006. [ Links ]
32. LEITE, A. and DIMITRAKOPOULOS, R. A stochastic optimization model for open pit mine planning: Application and risk analysis at a copper deposit. Transactions of the Institution of Mining and Metallurgy, Mining Technology, vol. 116, no. 3, 2007. pp. 109-118. [ Links ]
33. ALBOR, F. and DIMITRAKOPOULOS, R. An algorithmic approach to pushback design based on stochastic programming: Method, application and comparisons. Transactions of the Institution of Mining and Metallurgy, Mining Technology, vol. 119, no. 2, 2010. pp. 68-83. [ Links ]
34. RAMAZAN, S. and DIMITRAKOPOULOS, R. Production scheduling with uncertain supply: A new solution to the open pit mining problem. Optimization and Engineering, 2012. doi:10.1007/s11081-012-9186-2. ♦ [ Links ]
Paper received Nov. 2011
Revised paper received Apr. 2012.