A Multi-Parametric Maximum Flow Characterization of the Open-Pit Scheduling Problem

• 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.

Ämnesord

NATURVETENSKAP  -- Matematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics (hsv//eng)

Nyckelord

Open-pit mining

scheduling

maximum flow

minimum cut

Lagrangian relaxation

MATHEMATICS

MATEMATIK

Publikations- och innehållstyp

vet (ämneskategori)

ovr (ämneskategori)