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...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 287; číslo 3; s. 844 - 855
Hlavní autori:	Suzanne, Elodie, Absi, Nabil, Borodin, Valeria, van den Heuvel, Wilco
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.12.2020 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!