An efficient approach for solving the lot-sizing problem with time-varying storage capacities

DOI10.1016/J.EJOR.2006.09.096MaRDI QIDQ2482746zbMATH OpenOpenAlexFDO

Authors José M. Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, J. Sicilia

Publication date 24 April 2008

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.09.096

zbMATH Keywords

capacitycomputational improvementdynamic programminginventory-production: policieslot-sizing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Production models (90B30)

Recommendations

• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• A polynomial algorithm for the production/ordering planning problem with limited storage
• 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 with constant capacities and concave inventory costs
• Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time

Cites work

• A new characterization for the dynamic lot size problem with bounded inventory
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• Bounded Production and Inventory Models with Piecewise Concave Costs
• 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
• Improved Algorithms for Economic Lot Size Problems
• Minimum Concave Cost Flows in Certain Networks

Cited in

(9)

• The critical cut-off value approach for dynamic lot sizing problems with time varying cost parameters
• Joint optimization of dynamic lot and warehouse sizing problems
• Two-level lot-sizing with inventory bounds
• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
• Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
• An efficient dynamic programming approach to optimize capacitated lot-sizing problem
• Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities
• A polynomial algorithm for the production/ordering planning problem with limited storage

This page was built for publication: 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 Q2482746)