Skip to main content

Open-Pit Mine Production Scheduling: Improvements to MineLib Library Problems

  • Conference paper
  • First Online:
Proceedings of the 27th International Symposium on Mine Planning and Equipment Selection - MPES 2018

Abstract

Scheduling the extraction and the production in an open-pit mine with the goal of maximizing the net present value of the operation has been accomplished to date using various approaches including the use of mixed integer linear programming techniques. Since realistic models could have very large number of variables and constraints, the combinatorial optimization problem of finding an optimal, or at least, good feasible extraction schedule maximizing profit is computationally complex and difficult. It is also challenging to confirm whether various algorithms are addressing the same problem and are based on the same assumptions. The publication of MineLib, a library of test problem instances for open-pit mine production scheduling problems, namely the Constrained Pit Limit Problem (CPIT) and the Precedence Constrained Production Scheduling Problem (PCPSP), has provided new ways to address the scheduling in open-pit mines. In this paper, a full-binary formulation for PCPSP is proposed. The application of a sliding time window heuristic combined with a block preselection procedure to maximize the net present value in open-pit mines is tested on 10 PCPSP instances from MineLib library showing significant improvements over the previously reported results. In addition, the current state of the MineLib library, showing the best-known results for CPIT and PCPSP, is described for completion.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chiles, J., Delfiner, P.: Geostatistics: modeling spatial uncertainty, vol. 497. Wiley, Hoboken (2009)

    Google Scholar 

  2. Espinoza, D., Goycoolea, M., Moreno, E., Newman, A.: Minelib: a library of open pit mining problems. Ann. Oper. Res. 206(1), 93–114 (2013)

    Article  Google Scholar 

  3. Hochbaum, D.: The pseudoflow algorithm: a new algorithm for the maximum-flow problem. Oper. Res. 56(4), 992–1009 (2008)

    Article  Google Scholar 

  4. Hochbaum, D., Orlin, J.: Simplifications and speedups of the pseudoflow algorithm. Networks 61(1), 40–57 (2013)

    Article  Google Scholar 

  5. Lerchs, H., Grossmann, I.F.: Optimum design of open-pit mines. Trans. Can. Inst. Min. 68(1), 17–24 (1965)

    Google Scholar 

  6. Chicoisne, R., Espinoza, D., Goycoolea, M., Moreno, E., Rubio, E.: A new algorithm for the open-pit mine production scheduling problem. Oper. Res. 60(3), 517–528 (2012)

    Article  Google Scholar 

  7. Lamghari, A., Dimitrakopoulos, R., Ferland, J.: A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines. J. Glob. Optim. 63(3), 555–582 (2015)

    Article  Google Scholar 

  8. Jélvez, E., Morales, N., Nancel-Penard, P., Peypouquet, J., Reyes, P.: Aggregation heuristic for the open-pit block scheduling problem. Eur. J. Oper. Res. 249(3), 1169–1177 (2016)

    Article  Google Scholar 

  9. Liu, S., Kozan, E.: New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems. Expert Syst. Appl. 43, 59–65 (2016)

    Article  Google Scholar 

  10. Samavati, M., Essam, D., Nehring, M., Sarker, R.: A methodology for the large scale multi-period precedence-constrained knapsack problem: an application in the mining industry. Int. J. Prod. Econ. 193, 12–20 (2017)

    Article  Google Scholar 

  11. Samavati, M., Essam, D., Nehring, M., Sarker, R.: A new methodology for the open-pit mine production scheduling problem. Omega (2017b) In press

    Google Scholar 

  12. Bienstock, D., Zuckerberg, M.: Solving LP relaxations of large-scale precedence constrained problems. In: Proceedings of the International Conference on Integer Programming and Combinatorial Optimization, pp. 1–14. Springer, Heidelberg (2010)

    Google Scholar 

  13. Kenny, A., Li, X., Ernst, A., Thiruvady, D.: Towards solving large-scale precedence constrained production scheduling problems in mining. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1137–1144. ACM, New York (2017)

    Google Scholar 

  14. Jélvez, E., Morales, N., Nancel-Penard, P., Cornillier, F.: A New Hybrid Heuristic for the Precedence Constrained Production Scheduling Problem: A Mining Application. Submitted paper

    Google Scholar 

Download references

Acknowledgements

The authors acknowledge the support of CONICYT Basal Project FB0809—AMTC, Universidad de Chile.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. Nancel-Penard .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jélvez, E., Morales, N., Nancel-Penard, P. (2019). Open-Pit Mine Production Scheduling: Improvements to MineLib Library Problems. In: Widzyk-Capehart, E., Hekmat, A., Singhal, R. (eds) Proceedings of the 27th International Symposium on Mine Planning and Equipment Selection - MPES 2018. Springer, Cham. https://doi.org/10.1007/978-3-319-99220-4_18

Download citation

Publish with us

Policies and ethics