Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities
From MaRDI portal
Publication:545126
DOI10.1016/J.EJOR.2011.04.002zbMATH Open1231.90025OpenAlexW1990100134MaRDI QIDQ545126FDOQ545126
Wilco van den Heuvel, Hark-Chin Hwang, José M. Gutiérrez
Publication date: 22 June 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/21933
Recommendations
- A note on ``The economic lot sizing problem with inventory bounds
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities
- An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
- Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
- A new characterization for the dynamic lot size problem with bounded inventory
Cites Work
- Dynamic version of the economic lot size model
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Bounded Production and Inventory Models with Piecewise Concave Costs
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities
Cited In (5)
- Multi-item uncapacitated lot sizing problem with inventory bounds
- Two-level lot-sizing with inventory bounds
- Capacitated lot sizing problems with inventory bounds
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
- Joint optimization of dynamic lot and warehouse sizing problems
This page was built for publication: Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545126)
