返回
Optimization-based heuristics for underground mine scheduling
DOI:10.1016/j.ejor.2014.08.020.png)
摘要
En 中文
Underground mine production scheduling possesses mathematical structure similar to and yields many of the same challenges as general scheduling problems. That is, binary variables represent the time at which various activities are scheduled. Typical objectives seek to minimize costs or some measure of production time, or to maximize net present value; two principal types of constraints exist: (i) resource constraints and (ii) precedence constraints. In our setting, we maximize discounted metal production for the remaining life of an underground lead and zinc mine that uses three different underground methods to extract the ore. Resource constraints limit the grade, tonnage, and backfill paste (used for structural stability) in each time period, while precedence constraints enforce the sequence in which extraction (and backfill) is performed in accordance with the underground mining methods used. We tailor exact and heuristic approaches to reduce model size, and develop an optimization-based decomposition heuristic; both of these methods transform a computationally intractable problem to one for which we obtain solutions in seconds, or, at most, hours for problem instances based on data sets from the Lisheen mine near Thurles, Ireland. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Mining/metals industries: determining optimal operating policies at an underground mine
Production/scheduling applications production scheduling at an underground mine Integer programming applications determining a production schedule
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Combining Ability and Heterosis for Grain Iron and Zinc Densities in Pearl Millet珍珠粟的铁,锌密度的结合力和杂种优势
Crop Science
IF0

