IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v81y2018icp169-182.html
   My bibliography  Save this article

A new methodology for the open-pit mine production scheduling problem

Author

Listed:
  • Samavati, Mehran
  • Essam, Daryl
  • Nehring, Micah
  • Sarker, Ruhul

Abstract

The open pit mine production scheduling problem (OPMPSP) consists of scheduling the extraction of a mineral deposit that is broken into a number of smaller segments, or blocks, such that the net present value (NPV) of the operation is maximised. This problem has been formulated as an integer programming (IP) model, involving both knapsack and precedence constraints. However, due to the large number of blocks and precedence constraints, this model has remained impractical in real planning applications. In this paper, we propose a new method to quickly generate near optimum feasible (integer) solutions by using the fractional solutions from the linear programming (LP) relaxation of the IP model. To be applicable to real sized problems, a new heuristic that quickly computes a feasible LP solution is also proposed. Our methodology is tested on a set of both academically designed and real-world mine deposits, and shows better performance than the heuristic used to tackle the same deposits in the literature. Interestingly, the proposed methodology improves the best known solutions for the majority of the instances.

Suggested Citation

  • Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2018. "A new methodology for the open-pit mine production scheduling problem," Omega, Elsevier, vol. 81(C), pages 169-182.
    • Handle: RePEc:eee:jomega:v:81:y:2018:i:c:p:169-182
    DOI: 10.1016/j.omega.2017.10.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048317310447
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2017.10.008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Renaud Chicoisne & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Enrique Rubio, 2012. "A New Algorithm for the Open-Pit Mine Production Scheduling Problem," Operations Research, INFORMS, vol. 60(3), pages 517-528, June.
    2. W. Lambert & A. Newman, 2014. "Tailored Lagrangian Relaxation for the open pit block sequencing problem," Annals of Operations Research, Springer, vol. 222(1), pages 419-438, November.
    3. Jélvez, Enrique & Morales, Nelson & Nancel-Penard, Pierre & Peypouquet, Juan & Reyes, Patricio, 2016. "Aggregation heuristic for the open-pit block scheduling problem," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1169-1177.
    4. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2017. "A local branching heuristic for the open pit mine production scheduling problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 261-271.
    5. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.
    6. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    7. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    8. Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Alexandra Newman, 2013. "MineLib: a library of open pit mining problems," Annals of Operations Research, Springer, vol. 206(1), pages 93-114, July.
    9. Horst Albach, 1967. "Long Range Planning in Open-Pit Mining," Management Science, INFORMS, vol. 13(10), pages 549-568, June.
    10. Vallada, Eva & Ruiz, Rubén, 2011. "A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 211(3), pages 612-622, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cinna Seifi & Marco Schulze & Jürgen Zimmermann, 2021. "Solution procedures for block selection and sequencing in flat-bedded potash underground mines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 409-440, June.
    2. Jélvez, Enrique & Morales, Nelson & Nancel-Penard, Pierre & Cornillier, Fabien, 2020. "A new hybrid heuristic algorithm for the Precedence Constrained Production Scheduling Problem: A mining application," Omega, Elsevier, vol. 94(C).
    3. Haonan, Zhou & Samavati, Mehran & Hill, Andrew J., 2021. "Heuristics for integrated blending optimisation in a mining supply chain," Omega, Elsevier, vol. 102(C).
    4. Alipour, Aref & Khodaiari, Ali Asghar & Jafari, Ahmad & Tavakkoli-Moghaddam, Reza, 2022. "An integrated approach to open-pit mines production scheduling," Resources Policy, Elsevier, vol. 75(C).
    5. Aslan, Ayse & Ursavas, Evrim & Romeijnders, Ward, 2023. "A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems," Omega, Elsevier, vol. 115(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nancel-Penard, Pierre & Morales, Nelson & Cornillier, Fabien, 2022. "A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: An application to the open-pit mine block sequencing problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1088-1099.
    2. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2017. "A methodology for the large-scale multi-period precedence-constrained knapsack problem: an application in the mining industry," International Journal of Production Economics, Elsevier, vol. 193(C), pages 12-20.
    3. Jélvez, Enrique & Morales, Nelson & Nancel-Penard, Pierre & Cornillier, Fabien, 2020. "A new hybrid heuristic algorithm for the Precedence Constrained Production Scheduling Problem: A mining application," Omega, Elsevier, vol. 94(C).
    4. Cinna Seifi & Marco Schulze & Jürgen Zimmermann, 2021. "Solution procedures for block selection and sequencing in flat-bedded potash underground mines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 409-440, June.
    5. Zeng, Lanyan & Liu, Shi Qiang & Kozan, Erhan & Corry, Paul & Masoud, Mahmoud, 2021. "A comprehensive interdisciplinary review of mine supply chain management," Resources Policy, Elsevier, vol. 74(C).
    6. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2017. "A local branching heuristic for the open pit mine production scheduling problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 261-271.
    7. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    8. Changyou Xu & Gang Chen & Huabo Lu & Qiuxia Zhang & Zhengke Liu & Jing Bian, 2024. "Integrated Optimization of Production Scheduling and Haulage Route Planning in Open-Pit Mines," Mathematics, MDPI, vol. 12(13), pages 1-24, July.
    9. Jélvez, Enrique & Morales, Nelson & Nancel-Penard, Pierre & Peypouquet, Juan & Reyes, Patricio, 2016. "Aggregation heuristic for the open-pit block scheduling problem," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1169-1177.
    10. Gonzalo Muñoz & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Maurice Queyranne & Orlando Rivera Letelier, 2018. "A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling," Computational Optimization and Applications, Springer, vol. 69(2), pages 501-534, March.
    11. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    12. Amin Mousavi & Erhan Kozan & Shi Qiang Liu, 2016. "Comparative analysis of three metaheuristics for short-term open pit block sequencing," Journal of Heuristics, Springer, vol. 22(3), pages 301-329, June.
    13. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    14. Moreno, Eduardo & Rezakhah, Mojtaba & Newman, Alexandra & Ferreira, Felipe, 2017. "Linear models for stockpiling in open-pit mine production scheduling problems," European Journal of Operational Research, Elsevier, vol. 260(1), pages 212-221.
    15. Danish, Abid Ali Khan & Khan, Asif & Muhammad, Khan & Ahmad, Waqas & Salman, Saad, 2021. "A simulated annealing based approach for open pit mine production scheduling with stockpiling option," Resources Policy, Elsevier, vol. 71(C).
    16. Pan, Quan-Ke & Wang, Ling, 2012. "Effective heuristics for the blocking flowshop scheduling problem with makespan minimization," Omega, Elsevier, vol. 40(2), pages 218-229, April.
    17. Lin, Jingsi & Asad, Mohammad Waqar Ali & Topal, Erkan & Chang, Ping & Huang, Jinxin & Lin, Wei, 2024. "A novel model for sustainable production scheduling of an open-pit mining complex considering waste encapsulation," Resources Policy, Elsevier, vol. 91(C).
    18. Naderi, Bahman & Ruiz, Rubén, 2014. "A scatter search algorithm for the distributed permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 323-334.
    19. Benjamin Johnson & Alexandra Newman & Jeffrey King, 2017. "Optimizing high-level nuclear waste disposal within a deep geologic repository," Annals of Operations Research, Springer, vol. 253(2), pages 733-755, June.
    20. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:81:y:2018:i:c:p:169-182. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.