Article ID: | iaor20133927 |
Volume: | 206 |
Issue: | 1 |
Start Page Number: | 93 |
End Page Number: | 114 |
Publication Date: | Jul 2013 |
Journal: | Annals of Operations Research |
Authors: | Goycoolea Marcos, Newman Alexandra, Moreno Eduardo, Espinoza Daniel |
Keywords: | scheduling |
Similar to the mixed‐integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit problem determines a set of notional three‐dimensional blocks containing ore and/or waste material to extract to maximize value subject to geospatial precedence constraints. Open pit production scheduling problems seek to determine when, if ever, a block is extracted from an open pit mine. A typical objective is to maximize the net present value of the extracted ore; constraints include precedence and upper bounds on operational resource usage. Extensions of this problem can include (