IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v265y2023ics0925527323002311.html
   My bibliography  Save this article

Comparing approaches for a multi-level planning problem in a mining industry

Author

Listed:
  • Rakiz, Asma
  • Absi, Nabil
  • Fenies, Pierre

Abstract

This research investigates a global planning problem that integrates production, storage, and transportation decisions. The studied problem occurs in a leading mining industry. The logistics and production system is a capacitated multi-site, multi-level, and multi-product network where products are manufactured, stored, and transported, with time windows constraints, via a single railway to final stocks. To solve this problem, we propose an integrated mathematical model and three heuristic procedures, namely, relax and fix, top-down, and bottom-up. We generate several realistic instances and compare the performance of the heuristics to the exact method. The computational experiments show that the relax and fix heuristic allows good-quality solutions regardless of the considered instance. The top-down and bottom-up approaches reveal some counterintuitive managerial insights related to subsystem trade-offs and interactions. Finally, we demonstrate the high impact of train transport on the performance of the global problem.

Suggested Citation

  • Rakiz, Asma & Absi, Nabil & Fenies, Pierre, 2023. "Comparing approaches for a multi-level planning problem in a mining industry," International Journal of Production Economics, Elsevier, vol. 265(C).
    • Handle: RePEc:eee:proeco:v:265:y:2023:i:c:s0925527323002311
    DOI: 10.1016/j.ijpe.2023.108999
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527323002311
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2023.108999?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. Deyun Wang & Olivier Grunder & Abdellah EL Moudni, 2014. "Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(8), pages 1694-1707, August.
    2. Tao Wu & Leyuan Shi & Jie Song, 2012. "An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times," Annals of Operations Research, Springer, vol. 196(1), pages 635-650, July.
    3. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    4. Maes, Johan & McClain, John O. & Van Wassenhove, Luk N., 1991. "Multilevel capacitated lotsizing complexity and LP-based heuristics," European Journal of Operational Research, Elsevier, vol. 53(2), pages 131-148, July.
    5. Célia Paquay & Sabine Limbourg & Michaël Schyns & José Fernando Oliveira, 2018. "MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 56(4), pages 1581-1592, February.
    6. Oğuz Solyalı & Haldun Süral, 2012. "The one-warehouse multi-retailer problem: reformulation, classification, and computational results," Annals of Operations Research, Springer, vol. 196(1), pages 517-541, July.
    7. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    8. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    9. Lang, Jan Christian & Shen, Zuo-Jun Max, 2011. "Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions," European Journal of Operational Research, Elsevier, vol. 214(3), pages 595-605, November.
    10. Absi, Nabil & van den Heuvel, Wilco, 2019. "Worst case analysis of Relax and Fix heuristics for lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 449-458.
    11. Tarik Aouam & Kobe Geryl & Kunal Kumar & Nadjib Brahimi, 2018. "Production planning with order acceptance and demand uncertainty," Post-Print hal-01998733, HAL.
    12. Arshinder & Kanda, Arun & Deshmukh, S.G., 2008. "Supply chain coordination: Perspectives, empirical studies and research directions," International Journal of Production Economics, Elsevier, vol. 115(2), pages 316-335, October.
    13. Ríos-Solís, Yasmín Á & Ibarra-Rojas, Omar J. & Cabo, Marta & Possani, Edgar, 2020. "A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production," European Journal of Operational Research, Elsevier, vol. 284(3), pages 861-873.
    14. Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando & Toledo, Franklina M.B., 2014. "A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company," European Journal of Operational Research, Elsevier, vol. 237(2), pages 729-737.
    15. Chung-Lun Li & Vernon Ning Hsu & Wen-Qiang Xiao, 2004. "Dynamic Lot Sizing with Batch Ordering and Truckload Discounts," Operations Research, INFORMS, vol. 52(4), pages 639-654, August.
    16. 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).
    17. Erenguc, S. Selcuk & Simpson, N. C. & Vakharia, Asoo J., 1999. "Integrated production/distribution planning in supply chains: An invited review," European Journal of Operational Research, Elsevier, vol. 115(2), pages 219-236, June.
    18. Masoud Esmaeilikia & Behnam Fahimnia & Joeseph Sarkis & Kannan Govindan & Arun Kumar & John Mo, 2016. "Tactical supply chain planning models with inherent flexibility: definition and review," Annals of Operations Research, Springer, vol. 244(2), pages 407-427, September.
    19. Timpe, Christian H. & Kallrath, Josef, 2000. "Optimal planning in large multi-site production networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 422-435, October.
    20. Awi Federgruen & Michal Tzur, 1999. "Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 463-486, August.
    21. Yale T. Herer & Michal Tzur, 2001. "The dynamic transshipment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 386-408, August.
    22. Merce, C. & Fontan, G., 2003. "MIP-based heuristics for capacitated lotsizing problems," International Journal of Production Economics, Elsevier, vol. 85(1), pages 97-111, July.
    23. Pibernik, Richard & Sucky, Eric, 2007. "An approach to inter-domain master planning in supply chains," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 200-212, July.
    24. Flavio Molina & Reinaldo Morabito & Silvio Alexandre de Araujo, 2016. "MIP models for production lot sizing problems with distribution costs and cargo arrangement," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1395-1407, November.
    25. Lee, Woon-Seek & Han, Jong-Han & Cho, Sung-Jin, 2005. "A heuristic algorithm for a multi-product dynamic lot-sizing and shipping problem," International Journal of Production Economics, Elsevier, vol. 98(2), pages 204-214, November.
    26. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    27. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, August.
    28. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    29. Horst Tempelmeier & Karina Copil, 2016. "Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 819-847, October.
    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. Absi, Nabil & van den Heuvel, Wilco, 2019. "Worst case analysis of Relax and Fix heuristics for lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 449-458.
    2. Engebrethsen, Erna & Dauzère-Pérès, Stéphane, 2019. "Transportation mode selection in inventory models: A literature review," European Journal of Operational Research, Elsevier, vol. 279(1), pages 1-25.
    3. Li, Yantong & Chu, Feng & Côté, Jean-François & Coelho, Leandro C. & Chu, Chengbin, 2020. "The multi-plant perishable food production routing with packaging consideration," International Journal of Production Economics, Elsevier, vol. 221(C).
    4. Jean-Philippe Gayon & Guillaume Massonnet & Christophe Rapine & Gautier Stauffer, 2017. "Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 854-875, August.
    5. Tamssaouet, Karim & Engebrethsen, Erna & Dauzère-Pérès, Stéphane, 2023. "Multi-item dynamic lot sizing with multiple transportation modes and item fragmentation," International Journal of Production Economics, Elsevier, vol. 265(C).
    6. Sancak, Emre & Salman, F. Sibel, 2011. "Multi-item dynamic lot-sizing with delayed transportation policy," International Journal of Production Economics, Elsevier, vol. 131(2), pages 595-603, June.
    7. Rohaninejad, Mohammad & Hanzálek, Zdeněk, 2023. "Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches," International Journal of Production Economics, Elsevier, vol. 263(C).
    8. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. Becker, Tristan & Lier, Stefan & Werners, Brigitte, 2019. "Value of modular production concepts in future chemical industry production networks," European Journal of Operational Research, Elsevier, vol. 276(3), pages 957-970.
    10. Gruson, Matthieu & Cordeau, Jean-François & Jans, Raf, 2021. "Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure," European Journal of Operational Research, Elsevier, vol. 291(1), pages 206-217.
    11. Og̀uz Solyalı & Haldun Süral & Meltem Denizel, 2010. "The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(7), pages 653-666, October.
    12. Lai, Minghui & Cai, Xiaoqiang & Li, Xiang, 2017. "Mechanism design for collaborative production-distribution planning with shipment consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 137-159.
    13. Bunn, Kevin A. & Ventura, José A., 2023. "A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs," European Journal of Operational Research, Elsevier, vol. 307(1), pages 116-129.
    14. Pereira, Daniel Filipe & Oliveira, José Fernando & Carravilla, Maria Antónia, 2020. "Tactical sales and operations planning: A holistic framework and a literature review of decision-making models," International Journal of Production Economics, Elsevier, vol. 228(C).
    15. Marcos Mansano Furlan & Maristela Oliveira Santos, 2017. "BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 929-944, April.
    16. Dziuba, Daryna & Almeder, Christian, 2023. "New construction heuristic for capacitated lot sizing problems," European Journal of Operational Research, Elsevier, vol. 311(3), pages 906-920.
    17. Saravanan Venkatachalam & Arunachalam Narayanan, 2016. "Efficient formulation and heuristics for multi-item single source ordering problem with transportation cost," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4087-4103, July.
    18. Guo, Peng & Weidinger, Felix & Boysen, Nils, 2019. "Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals," Omega, Elsevier, vol. 89(C), pages 110-121.
    19. G. Rius-Sorolla & J. Maheut & S. Estellés-Miguel & J. P. Garcia-Sabater, 2020. "Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 61-104, March.
    20. Hwang, Hark-Chin & Kang, Jangha, 2016. "Two-phase algorithm for the lot-sizing problem with backlogging for stepwise transportation cost without speculative motives," Omega, Elsevier, vol. 59(PB), pages 238-250.

    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:proeco:v:265:y:2023:i:c:s0925527323002311. 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/locate/ijpe .

    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.