Dynamic short term production scheduling and machine allocation in underground mining using mathematical programming

Abstract

Maximising value is the main objective when developing long term mine production schedules. These results provide input for the development of a short term schedule that aims to meet process plant feed requirements so as to produce a quality saleable product. This paper reviews previous work on optimised short- and long term production scheduling and real time fleet management systems. A new dynamic mathematical model using mixed integer programming is proposed to optimise short term production scheduling and machine allocation for application in sublevel stoping operations. The objective of the model is to minimise deviation from targeted metal production. The dynamic nature of the model not only optimises the shift based schedule but also allows rapid equipment reassignment to take place as underground operating conditions change. Optimal results are generated in less than 1 min when trialled on a conceptual sublevel stoping dataset.

Keywords

MIXED INTEGER PROGRAMMING SHORT TERM PRODUCTION SCHEDULING UNDERGROUND MINE OPTIMISATION MACHINE ALLOCATION

Get full access to this article

View all access options for this article.

References

Trout

L. P.

: ‘Underground mine production scheduling using mixed integer programming’, Proc. 25th Int. Symp. on ‘Application of computers and operations research in the minerals industries’, Brisbane, Australia, July 1995, The Australasian Institute of Mining and Metallurgy, 395–400.

Nehring

and Topal

: ‘Production schedule optimisation in underground hard rock mining using mixed integer programming’, Proc. Project Evaluation Conf. 2007, Melbourne, Australia, June 2007, The Australasian Institute of Mining and Metallurgy, 169–175.

Little

, Nehring

and Topal

: ‘A new mixed-integer programming model for mine production scheduling optimisation in sublevel stope mining’, Proc. 2008 Australian Mining Technology Conf., Brisbane, Australia, September 2008, The Australasian Institute of Mining and Metallurgy, 157–172.

Topal

: ‘Early start and late start algorithms to improve the solution time for long term underground mine production scheduling’, S. Afr. Inst. Min. Metall. J., 2008, 108, 101–107.

McIsaac

: ‘Long-term planning of an underground mine using mixed-integer linear programming’, Can. Inst. Min., 2008, 98, (1089), 1–6.

Carlyle

and Eaves

B. C.

: ‘Underground planning at stillwater mining company’, Interfaces, 2001, 31, 50–60.

White

J. W.

, Olson

J. P.

and Vohnout

S. I.

: ‘On improving truck/ shovel productivity in open pit mines’, CIM Bull., 1993, (9), 43–49.

Zhang

, Zhao

, Lu

and Xu

: ‘Optimisation model of truck flow at open-pit mines and standards for flexibility test’, J. Univ. Sci. Technol. Beijing, 2004, 11, (5), 389–393.

Osanloo

and Saidy

S. H.

: ‘The possibility of using semidispatching systems in Sarcheshmeh copper mine of Iran’, Proc. 28th Int. Symp. on ‘Computer applications in the minerals industries’, Golden, CO, USA, October 1999, Colorado School of Mines, 243–252.

10.

C. H.

, Kresta

J. V.

, Forbes

J. F.

and Marquez

H. J.

: ‘A stochastic optimisation approach to mine truck allocation’, Int. J. Surf. Min. Reclam. Environ., 2005, 19, (3), 162–175.

11.

Beaulieu

and Gamache

: ‘An enumeration algorithm for solving the fleet management problem in underground mines’, Comput. Oper. Res., 2006, 33, 1606–1624.

12.

Tsomondo

C. M.

: ‘A flexible underground mining system with active dispatching model – a solution for the next millennium’, Proc. 28th Int. Symp. on ‘Computer applications in the minerals industries’, Golden, CO, USA, October 1999, Colorado School of Mines, 463–473.

13.

Saayman

, Craig

I. K.

and Camisani-Calzolari

F. R.

: ‘Optimisation of an autonomous vehicle dispatch system in an underground mine’, S. Afr. Inst. Min. Metall. J., 2006, 106, 77– 86.

14.

Runciman

, Vagenas

and Corkal

: ‘Simulation of haulage truck loading techniques in an underground mine using WITNESS’, Simulation, 1997, 68, (5), 291–299.