A heuristic approach for scheduling activities with ‘OR’-precedence constraints at an underground mine

ABSTRACT

Medium-term development planning of underground mines requires scheduling multiple activities to comply with long-term milestones, and to obtain a time span as short as possible. However, the planning must also respect the availability of construction resources and precedence constraints, which in our case can be disjunctive, that is with more than one alternative predecessor.

In this paper, we present an optimisation model to find the schedule of minimum length, satisfying all the constraints mentioned. We develop a heuristic approach to solve it and show that it can be used to produce feasible development plans in a real mine.

KEYWORDS:

• Underground mine planning
• mixed-integer programming
• heuristic
• ‘OR’-precedence constraints
• mine development

Acknowledgments

The authors would like to thank the Advanced Mining Technology Center and the organizations that funded this research. This work was supported by CONICYT basal Funding Grant AFB180004, and by CORFO under Grant 16CONTEC-67413.

Disclosure Statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This work was supported by the Corporación de Fomento de la Producción [16CONTEC-67413];Comisión Nacional de Investigación Científica y Tecnológica (CL) [AFB180004].