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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 287; no. 3; pp. 844 - 855
Main Authors:	Suzanne, Elodie, Absi, Nabil, Borodin, Valeria, van den Heuvel, Wilco
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.12.2020 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!