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

Elodie Suzanne,Nabil Absi,Valeria Borodin,Wilco van den Heuvel

European Journal of Operational Research（2020）

引用 19|浏览11

暂无评分

摘要

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

查看译文

关键词

Circular economy,Production planning,Lot-sizing,By-product,Dynamic programming,Complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要