IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v287y2020i3p844-855.html
   My bibliography  Save this article

A single-item lot-sizing problem with a by-product and inventory capacities

Author

Listed:
  • Suzanne, Elodie
  • Absi, Nabil
  • Borodin, Valeria
  • van den Heuvel, Wilco

Abstract

The high pace of waste accumulation in landfills and the depletion of scarce natural resources lead us to seek pathways for converting unavoidable production outputs into useful and high added-value products. In this context, we formalize and propose a model for the single-item lot-sizing problem, which integrates the management of unavoidable production residues classified as by-products. During the production process of a main product, a by-product is generated, stored in a limited capacity and transported with a fixed transportation cost. This problem is investigated for two cases of the by-product inventory capacity: time-dependent and constant. We prove that the problem with inventory capacities is NP-Hard. To solve it optimally, we develop a pseudo-polynomial time dynamic programming algorithm. For the case with stationary inventory capacities, a polynomial time dynamic programming algorithm is proposed.

Suggested Citation

  • Suzanne, Elodie & Absi, Nabil & Borodin, Valeria & van den Heuvel, Wilco, 2020. "A single-item lot-sizing problem with a by-product and inventory capacities," European Journal of Operational Research, Elsevier, vol. 287(3), pages 844-855.
    • Handle: RePEc:eee:ejores:v:287:y:2020:i:3:p:844-855
    DOI: 10.1016/j.ejor.2020.05.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720304458
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.05.017?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. Barbosa-Póvoa, Ana Paula & da Silva, Cátia & Carvalho, Ana, 2018. "Opportunities and challenges in sustainable supply chain: An operations research perspective," European Journal of Operational Research, Elsevier, vol. 268(2), pages 399-431.
    2. Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
    3. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    4. Gabriel R. Bitran & Thin-Yin Leong, 1992. "Deterministic Approximations to Co-Production Problems with Service Constraints and Random Yields," Management Science, INFORMS, vol. 38(5), pages 724-742, May.
    5. Rowshannahad, Mehdi & Absi, Nabil & Dauzère-Pérès, Stéphane & Cassini, Bernard, 2018. "Multi-item bi-level supply chain planning with multiple remanufacturing of reusable by-products," International Journal of Production Economics, Elsevier, vol. 198(C), pages 25-37.
    6. 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.
    7. Saurabh Bansal & Sandra Transchel, 2014. "Managing Supply Risk for Vertically Differentiated Co-Products," Production and Operations Management, Production and Operations Management Society, vol. 23(9), pages 1577-1598, September.
    8. Deishin Lee, 2012. "Turning Waste into By-Product," Manufacturing & Service Operations Management, INFORMS, vol. 14(1), pages 115-127, January.
    9. Gabriel R. Bitran & Stephen M. Gilbert, 1994. "Co-Production Processes with Random Yields in the Semiconductor Industry," Operations Research, INFORMS, vol. 42(3), pages 476-491, June.
    10. Srikrishna Sridhar & Jeffrey Linderoth & James Luedtke, 2014. "Models and solution techniques for production planning problems with increasing byproducts," Journal of Global Optimization, Springer, vol. 59(2), pages 597-631, July.
    11. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    12. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    13. Ying-Ju Chen & Brian Tomlin & Yimin Wang, 2013. "Coproduct Technologies: Product Line Design and Process Innovation," Management Science, INFORMS, vol. 59(12), pages 2772-2789, December.
    14. Caner TaskIn, Z. & Tamer Ünal, A., 2009. "Tactical level planning in float glass manufacturing with co-production, random yields and substitutable products," European Journal of Operational Research, Elsevier, vol. 199(1), pages 252-261, November.
    15. Lu, Liang & Qi, Xiangtong, 2011. "Dynamic lot sizing for multiple products with a new joint replenishment model," European Journal of Operational Research, Elsevier, vol. 212(1), pages 74-80, July.
    16. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    17. Awi Federgruen & Michal Tzur, 1991. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time," Management Science, INFORMS, vol. 37(8), pages 909-925, August.
    18. Spengler, Th. & Puchert, H. & Penkuhn, T. & Rentz, O., 1997. "Environmental integrated production and recycling management," European Journal of Operational Research, Elsevier, vol. 97(2), pages 308-326, March.
    19. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    20. Lee, Deishin & Tongarlak, Mustafa Hayri, 2017. "Converting retail food waste into by-product," European Journal of Operational Research, Elsevier, vol. 257(3), pages 944-956.
    21. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    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. José M. Gutiérrez & Beatriz Abdul-Jalbar & Joaquín Sicilia & Inmaculada Rodríguez-Martín, 2021. "Effective Algorithms for the Economic Lot-Sizing Problem with Bounded Inventory and Linear Fixed-Charge Cost Structure," Mathematics, MDPI, vol. 9(6), pages 1-21, March.
    2. Hezarkhani, Behzad & Demirel, Guven & Bouchery, Yann & Dora, Manoj, 2023. "Can “ugly veg” supply chains reduce food loss?," European Journal of Operational Research, Elsevier, vol. 309(1), pages 117-132.
    3. Meng, Mingyou & Deng, Shiming & Zhou, Pin & Xu, He, 2023. "The effects of subsidy programs in byproduct synergy operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(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. Suzanne, Elodie & Absi, Nabil & Borodin, Valeria, 2020. "Towards circular economy in production planning: Challenges and opportunities," European Journal of Operational Research, Elsevier, vol. 287(1), pages 168-190.
    2. Hwang, Hark-Chin & Jaruphongsa, Wikrom, 2008. "Dynamic lot-sizing model for major and minor demands," European Journal of Operational Research, Elsevier, vol. 184(2), pages 711-724, January.
    3. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    4. 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.
    5. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    6. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    7. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    8. van Hoesel, C.P.M. & Romeijn, H.E. & Romero Morales, M.D. & Wagelmans, A., 2002. "Polynomial time algorithms for some multi-level lot-sizing problems with production capacities," Research Memorandum 018, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    9. Ying-Ju Chen & Brian Tomlin & Yimin Wang, 2017. "Dual Coproduct Technologies: Implications for Process Development and Adoption," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 692-712, October.
    10. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    11. 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.
    12. van Hoesel, S. & Romeijn, H.E. & Romero Morales, D. & Wagelmans, A.P.M., 2002. "Polynomial Time Algorithms For Some Multi-Level Lot-Sizing Problems With Production Capacities," ERIM Report Series Research in Management ERS-2002-59-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.
    13. Zhou, Pin & Xu, He & Wang, Hongwei, 2020. "Value of by-product synergy: A supply chain perspective," European Journal of Operational Research, Elsevier, vol. 285(3), pages 941-954.
    14. Eksioglu, Sandra Duni, 2009. "A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment," European Journal of Operational Research, Elsevier, vol. 197(1), pages 93-101, August.
    15. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    16. Hwang, Hark-Chin & Kang, Jangha, 2020. "The two-level lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 90(C).
    17. van den Heuvel, W.J. & Wagelmans, A.P.M., 2003. "A geometric algorithm to solve the NI/G/NI/ND capacitated lot-sizing problem in O(T2) time," Econometric Institute Research Papers EI 2003-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    18. Jian Yang & Boaz Golany & Gang Yu, 2005. "A concave‐cost production planning problem with remanufacturing options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 443-458, August.
    19. Mathieu Van Vyve, 2007. "Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 594-613, August.
    20. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P.M. Wagelmans, 2002. "Polynomial Time Algorithms for Some Multi-Level Lot-Sizing Problems with Production Capacities," Tinbergen Institute Discussion Papers 02-066/4, Tinbergen Institute.

    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:ejores:v:287:y:2020:i:3:p:844-855. 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/eor .

    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.