Abstract
The profitability of an underground mine is greatly affected by the scheduling of the mobile production fleet. Today, most mine operations are scheduled manually, which is a tedious and error-prone activity. In this contribution, we present and formalize the underground mine scheduling problem, and propose a CP-based model for solving it. The model is evaluated on instances generated from real data. The results are promising and show a potential for further extensions.
Cite
CITATION STYLE
Åstrand, M., Johansson, M., & Zanarini, A. (2018). Fleet scheduling in underground mines using constraint programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10848 LNCS, pp. 605–613). Springer Verlag. https://doi.org/10.1007/978-3-319-93031-2_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
