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

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 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

Contributor : Élodie Suzanne <>
Submitted on : Wednesday, November 13, 2019 - 6:09:55 PM
Last modification on : Friday, November 15, 2019 - 1:37:30 AM


WP EMSE CMP-SFL 2019-2.pdf
Files produced by the author(s)


  • HAL Id : emse-02362256, version 1



Elodie Suzanne, Nabil Absi, Valeria Borodin, Wilco van den Heuvel. A single-item lot-sizing problem with a by-product and inventory capacities. 2019. ⟨emse-02362256⟩



Record views


Files downloads