IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i21p4140-d964656.html
   My bibliography  Save this article

An Optimized Open Pit Mine Application for Limestone Quarry Production Scheduling to Maximize Net Present Value

Author

Listed:
  • Devendra Joshi

    (Department of CSE, Koneru Lakshmaiah Education Foundation, Vaddeswaram 522302, India)

  • Premkumar Chithaluru

    (Department of CSE, Koneru Lakshmaiah Education Foundation, Vaddeswaram 522302, India
    Department of Project Management, Universidad Internacional Iberoamericana, Campeche 24560, Mexico)

  • Aman Singh

    (Department of Project Management, Universidad Internacional Iberoamericana, Campeche 24560, Mexico
    Higher Polytechnic School, Universidad Europea del Atlántico, C/Isabel Torres 21, 39011 Santander, Spain)

  • Arvind Yadav

    (Department of CSE, Koneru Lakshmaiah Education Foundation, Vaddeswaram 522302, India)

  • Dalia H. Elkamchouchi

    (Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia)

  • Jose Breñosa

    (Higher Polytechnic School, Universidad Europea del Atlántico, C/Isabel Torres 21, 39011 Santander, Spain
    Department of Project Management, Universidad Internacional Iberoamericana, Arecibo, PR 00613, USA)

  • Divya Anand

    (Higher Polytechnic School, Universidad Europea del Atlántico, C/Isabel Torres 21, 39011 Santander, Spain
    School of Computer Science and Engineering, Lovely Professional University, Punjab 144411, India)

Abstract

This study involves a working limestone mine that supplies limestone to the cement factory. The two main goals of this paper are to (a) determine how long an operating mine can continue to provide the cement plant with the quality and quantity of materials it needs, and (b) explore the viability of combining some limestone from a nearby mine with the study mine limestone to meet the cement plant’s quality and quantity goals. These objectives are accomplished by figuring out the maximum net profit for the ultimate pit limit and production sequencing of the mining blocks. The issues were resolved using a branch-and-cut based sequential integer and mixed integer programming problem. The study mine can exclusively feed the cement plant for up to 15 years, according to the data. However, it was also noted that the addition of the limestone from the neighboring mine substantially increased the mine’s life (85 years). The findings also showed that, when compared with the production planning formulation that the company is now using, the proposed approach creates 10% more profit. The suggested method also aids in determining the desired desirable quality of the limestone that will be transported from the nearby mine throughout each production stage.

Suggested Citation

  • Devendra Joshi & Premkumar Chithaluru & Aman Singh & Arvind Yadav & Dalia H. Elkamchouchi & Jose Breñosa & Divya Anand, 2022. "An Optimized Open Pit Mine Application for Limestone Quarry Production Scheduling to Maximize Net Present Value," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:21:p:4140-:d:964656
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/21/4140/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/21/4140/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ramazan, Salih, 2007. "The new Fundamental Tree Algorithm for production scheduling of open pit mines," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1153-1166, March.
    2. Jean-Claude Picard, 1976. "Maximal Closure of a Graph and Applications to Combinatorial Problems," Management Science, INFORMS, vol. 22(11), pages 1268-1272, July.
    Full references (including those not matched with items on IDEAS)

    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. Rafael Epstein & Marcel Goic & Andrés Weintraub & Jaime Catalán & Pablo Santibáñez & Rodolfo Urrutia & Raúl Cancino & Sergio Gaete & Augusto Aguayo & Felipe Caro, 2012. "Optimizing Long-Term Production Plans in Underground and Open-Pit Copper Mines," Operations Research, INFORMS, vol. 60(1), pages 4-17, February.
    2. Chatterjee, Snehamoy & Sethi, Manas Ranjan & Asad, Mohammad Waqar Ali, 2016. "Production phase and ultimate pit limit design under commodity price uncertainty," European Journal of Operational Research, Elsevier, vol. 248(2), pages 658-667.
    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. Del Castillo, Maria Fernanda & Dimitrakopoulos, Roussos, 2016. "A multivariate destination policy for geometallurgical variables in mineral value chains using coalition-formation clustering," Resources Policy, Elsevier, vol. 50(C), pages 322-332.
    5. Amina Lamghari & Roussos Dimitrakopoulos & Jacques Ferland, 2015. "A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines," Journal of Global Optimization, Springer, vol. 63(3), pages 555-582, November.
    6. Biswas, Pritam & Sinha, Rabindra Kumar & Sen, Phalguni, 2023. "A review of state-of-the-art techniques for the determination of the optimum cut-off grade of a metalliferous deposit with a bibliometric mapping in a surface mine planning context," Resources Policy, Elsevier, vol. 83(C).
    7. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    8. King, Barry & Goycoolea, Marcos & Newman, A., 2017. "Optimizing the open pit-to-underground mining transition," European Journal of Operational Research, Elsevier, vol. 257(1), pages 297-309.
    9. W. Brian Lambert & Andrea Brickey & Alexandra M. Newman & Kelly Eurek, 2014. "Open-Pit Block-Sequencing Formulations: A Tutorial," Interfaces, INFORMS, vol. 44(2), pages 127-142, April.
    10. Csapó, Gergely & Müller, Rudolf, 2013. "Optimal mechanism design for the private supply of a public good," Games and Economic Behavior, Elsevier, vol. 80(C), pages 229-242.
    11. Domenico Moramarco & Umutcan Salman, 2023. "Equal opportunities in many-to-one matching markets," Working Papers 649, ECINEQ, Society for the Study of Economic Inequality.
    12. Dorit S. Hochbaum, 2003. "Efficient Algorithms for the Inverse Spanning-Tree Problem," Operations Research, INFORMS, vol. 51(5), pages 785-797, October.
    13. Esmaeili, Ahmadreza & Hamidi, Jafar Khademi & Mousavi, Amin, 2023. "Determination of sublevel stoping layout using a network flow algorithm and the MRMR classification system," Resources Policy, Elsevier, vol. 80(C).
    14. Alexandra M. Newman & Enrique Rubio & Rodrigo Caro & Andrés Weintraub & Kelly Eurek, 2010. "A Review of Operations Research in Mine Planning," Interfaces, INFORMS, vol. 40(3), pages 222-245, June.
    15. 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.
    16. 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.
    17. Jianlong Wang & Weilong Wang & Yong Liu, 2024. "RETRACTED ARTICLE: Exploring the impact of clean energy interconnections on sustainable economic growth in China," Economic Change and Restructuring, Springer, vol. 57(3), pages 1-32, June.
    18. Pavlos Eirinakis & Dimitrios Magos & Ioannis Mourtos & Panayiotis Miliotis, 2012. "Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 245-259, May.
    19. M. Vanhoucke, 2006. "An efficient hybrid search algorithm for various optimization problems," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/365, Ghent University, Faculty of Economics and Business Administration.
    20. Bradley Sturt, 2021. "A nonparametric algorithm for optimal stopping based on robust optimization," Papers 2103.03300, arXiv.org, revised Mar 2023.

    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:gam:jmathe:v:10:y:2022:i:21:p:4140-:d:964656. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.