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

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!