An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost

DOI10.1016/J.ORL.2007.09.005zbMath1151.90011OpenAlexW2002069978MaRDI QIDQ943784

Bing Lin, Yi Feng, Shaoxiang Chen, Arun Kumar

Publication date: 10 September 2008

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

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

zbMATH Keywords

algorithmproductiondynamic programminginventoryalgorithm complexity

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (2)

Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ Single-item dynamic lot-sizing problems: an updated survey

Cites Work

• Lot sizing and scheduling -- survey and extensions
• Dynamic Version of the Economic Lot Size Model
• An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
• A Dynamic Lot-Sizing Model with Demand Time Windows
• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• Deterministic Production Planning: Algorithms and Complexity
• Computational Complexity of the Capacitated Lot Size Problem
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Deterministic Production Planning with Concave Costs and Capacity Constraints

This page was built for publication: An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost