The current trend of deeper and lower-grade deposits makes open pit mining less profitable. Mass mining alternatives have to be developed if mining at a similar rate is to be continued. Block cave mining is becoming an increasingly popular mass mining method, especially for large copper deposits currently being mined with open pit methods. After finding the initial evaluation of a range of levels for starting the extraction of block cave mining, production scheduling plays a key role in the entire project's profitability. Traditional long-term mine planning is based on deterministic orebody models, which can ignore the uncertainty in the geological resources. The purpose of this paper is to present a methodology to find the optimal extraction horizon and sequence of extraction for that horizon under grade uncertainty. The model does not explicitly take into account other potential project value drivers such as waste ingress into the draw column or the impact of primary or secondary fragmentation on either production or recovery. Maximum net present value (NPV) is determined using a mixed-integer linear programming (MILP) model after choosing the optimum horizon of extraction given some constraints such as mining capacity, production grade, extraction rate and precedence. Application of the method for block cave production scheduling using a case study over 15 periods is presented.
Among the underground mining methods available, caving methods are favoured because of their low cost and high production rates. Block caving operations offer a much smaller environmental footprint compared to equivalent open pit operations due to the much smaller volume of waste to be moved and handled. In general, draw control is fundamental to success or failure of any block cave operation. Establishing relationships among draw columns to consider depletion rates of other draw columns is complex but essential to provide a reasonable solution for real block caving mines. This paper presents a mixed-integer linear programming (MILP) model to optimise the extraction sequence of drawpoints over multiple time horizons of block cave mines with respect to draw control systems. A mathematical draw rate strategy is formulated in this paper to guarantee exact solutions. Draw control management provides optimal operating strategies while meeting practical, technical and environmental constraints. Furthermore, dilution and caving are improved indirectly, because the method considers the draw rate strategy according to geotechnical properties of the rock mass. Surface displacements are controlled by using the draw rate in all drawpoints during the life of the mine. Application and verification of the presented model for production scheduling based on the draw control system are presented using a case study.
Although some scheduling optimization models can be found in the literature, few of them include material flow and the resulting dilution. In this paper, a 3D mixing methodology is proposed to be incorporated into the production schedule model. To capture horizontal and vertical mixing, different scenarios are generated based on the particles that fall into a 3D cone of movement, CoM. The proposed model is a block caving scheduling optimizer, BCSO, which includes mixing in the optimization. The BCSO was tested on a real-case block caving mine with 424 drawpoints; also, a number of production schedules were generated for the same mine using PCBC GEOVIA software. Resulting production schedules show that the BCSO can improve the NPV of the project by 2% to 4% compared to the best case generated by PCBC.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.