A maximum flow formulation of a multi-period open-pit mining problem
2014 (English)In: Operational Research, ISSN 1109-2858, Vol. 14, no 1, 1-10 p.Article in journal (Refereed) Published
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-period open-pit mining problem can be solved as a maximum flow problem in a time-expanded mine graph. Further, the minimum cut in this graph will define an optimal sequence of pits. This result extends a well-known result of J.-C. Picard from 1976 for the open-pit mine design problem, that is, the single-period case, to the case of multiple time periods.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014. Vol. 14, no 1, 1-10 p.
Open-pit mining; Integer programming; Scheduling; Maximum flow; Maximal closure; Lagrangean relaxation
IdentifiersURN: urn:nbn:se:liu:diva-106129DOI: 10.1007/s12351-013-0140-7ISI: 000333172000001OAI: oai:DiVA.org:liu-106129DiVA: diva2:714036