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

•A single-item lot-sizing problem (ULS-B) dealing with a by-product is studied.•We prove that ULS-B with inventory capacities is weakly NP-Hard.•A pseudo-polynomial dynamic programming (DP) algorithm is proposed for ULS-B.•For ULS-B with constant inventory capacities, a polynomial DP algorithm is de...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 287; H. 3; S. 844 - 855
Hauptverfasser: Suzanne, Elodie, Absi, Nabil, Borodin, Valeria, van den Heuvel, Wilco
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 16.12.2020
Elsevier
Schlagworte:
By-product
Circular economy
Complexity
Computer Science
Dynamic programming
Lot-sizing
Operations Research
Production planning
Lot-sizing
Circular economy
By-product
Dynamic programming
Production planning
Complexity
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•A single-item lot-sizing problem (ULS-B) dealing with a by-product is studied.•We prove that ULS-B with inventory capacities is weakly NP-Hard.•A pseudo-polynomial dynamic programming (DP) algorithm is proposed for ULS-B.•For ULS-B with constant inventory capacities, a polynomial DP algorithm is developed. 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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2020.05.017