Planning for Mining Operations with Time and Resource Constraints
N Lipovetzky, CN Burt, A Pearce, PJ Stuckey, undefined Steve Chien, Minh Do, Alan Fern, and Wheeler Ruml (ed.)
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling | AAAI Press | Published : 2014
We study a daily mine planning problem where, given a set of blocks we wish to mine, our task is to generate a mining sequence for the excavators such that blend-ing resource constraints are met at various stages of the sequence. Such time-oriented resource constraints are not traditionally handled well by automated planners. On the other hand, the remaining problem involves finding node-disjoint sequences with state-dependent travel times on the arcs, which are highly challenging for a Mixed-Integer Program (MIP). In this paper, we address the problem of finding feasible sequences using a combined MIP and planning based decomposition approach. The MIP takes care of the resource constraints,..View full abstract
Related Projects (2)
Awarded by Australian Research Council
The authors wish to thank Jon Lapwood and John Usher from Rio Tinto for their extensive discussions throughout our research. This research was co-funded by the Australian Research Council linkage grant LP11010015 "Making the Pilbara Blend: Agile Mine Scheduling through Contingent Planning" and industry partner Rio Tinto.