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

DOI10.1016/j.ejor.2006.09.096zbMath1146.90313MaRDI QIDQ2482746

Joaquín Sicilia, Antonio Sedeño-Noda, José Miguel Gutiérrez, Marcos Colebrook

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

dynamic programming; capacity; lot-sizing; inventory-production: policies; computational improvement

Mathematics Subject Classification ID

90B30: Production models

90B05: Inventory, storage, reservoirs

Related Items

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

Cites Work

• A new characterization for the dynamic lot size problem with bounded inventory
• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• Dynamic Version of the Economic Lot Size Model
• 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
• Bounded Production and Inventory Models with Piecewise Concave Costs
• Improved Algorithms for Economic Lot Size Problems
• Minimum Concave Cost Flows in Certain Networks