An O(T T) algorithm for the dynamic lot size problem with limited storage and linear costs

DOI10.1023/B:COAP.0000033966.31088.98MaRDI QIDQ1888151zbMATH OpenOpenAlexFDO

Authors Antonio Sedeño-Noda, José M. Gutiérrez, Beatriz Abdul-Jalbar, J. Sicilia

Publication date 22 November 2004

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:coap.0000033966.31088.98

zbMATH Keywords

lot sizecapacity constraintInventory dynamic systems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Recommendations

• A new characterization for the dynamic lot size problem with bounded inventory
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• 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
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time

Cited in

(14)

• A Greedy Algorithm for Capacitated Lot-Sizing Problems
• Analysis of a dynamic lot-sizing problem with production capacity constraint
• Multi-item uncapacitated lot sizing problem with inventory bounds
• Single-item dynamic lot-sizing problems: an updated survey
• A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
• 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
• Capacitated lot sizing problems with inventory bounds
• Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities
• Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• A minimum concave-cost dynamic network flow problem with an application to lot-sizing
• A new characterization for the dynamic lot size problem with bounded inventory
• Algorithms for the multi-item multi-vehicles dynamic lot sizing problem

This page was built for publication: An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888151)