A Multi-Parametric Maximum Flow Characterization of the Open-Pit Scheduling Problem
(English)Manuscript (preprint) (Other academic)
We consider the problem of finding an optimal mining schedule for an openpit during a number of time periods, subject to a mining capacity restriction for each time period. By applying Lagrangian relaxation to the capacities, a multi-parametric formulation is obtained. We show that this formulation can be restated as a maximum flow problem in a time-expanded network. This result extends a well-known result of Picard from 1976 for the open-pit design problem, that is, the single-period case, to the case of multiple time periods.
Open-pit mining, scheduling, maximum flow, minimum cut, Lagrangian relaxation
IdentifiersURN: urn:nbn:se:liu:diva-70841OAI: oai:DiVA.org:liu-70841DiVA: diva2:442013