An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
From MaRDI portal
Publication:2496059
DOI10.1016/j.cor.2005.02.046zbMath1094.90004OpenAlexW1975354654MaRDI QIDQ2496059
Albert P. M. Wagelmans, Wilco van den Heuvel
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.046
Related Items (9)
Algorithms for the two-stage production-capacitated lot-sizing problem ⋮ Dual-mode production planning for manufacturing with emission constraints ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Economic lot sizing problem with inventory dependent demand ⋮ Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories ⋮ An FPTAS for SM‐CELS problem with monotone cost functions ⋮ A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale ⋮ Dynamic lot sizing with product returns and remanufacturing
Cites Work
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- 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
- An O(T2) 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
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Improved Algorithms for Economic Lot Size Problems
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
This page was built for publication: An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem