A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs

DOI10.1016/J.ORL.2017.07.010zbMath1409.90022OpenAlexW2744475252MaRDI QIDQ1728316

Jinwen Ou

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.07.010

zbMATH Keywords

algorithmdynamic programmingconcave ordering costseconomic lot-sizingconstant capacity

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (2)

Single-item lot-sizing with quantity discount and bounded inventory ⋮ Production lot-sizing with dynamic capacity adjustment

Cites Work

• Improved exact algorithms to economic lot-sizing with piecewise linear production costs
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Economic lot sizing with constant capacities and concave inventory costs
• Improved Algorithms for Economic Lot Size Problems
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size

This page was built for publication: A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs