A new characterization for the dynamic lot size problem with bounded inventory
From MaRDI portal
Publication:1869910
DOI10.1016/S0305-0548(01)00105-8zbMath1029.90006MaRDI QIDQ1869910
Joaquín Sicilia, Antonio Sedeño-Noda, José Miguel Gutiérrez, Marcos Colebrook
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
90B05: Inventory, storage, reservoirs
Related Items
Warehouse sizing and inventory scheduling for multiple stock-keeping products, Modeling industrial lot sizing problems: a review, Lot sizing with bounded inventory and lost sales, A polynomial algorithm for the production/ordering planning problem with limited storage, An efficient approach for solving the lot-sizing problem with time-varying storage capacities, Single item lot sizing problems, Capacitated production planning with outsourcing in an OKP company, A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test
Cites Work
- Dynamic Version of the Economic Lot Size Model
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- 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
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- Contraction Mappings in the Theory Underlying Dynamic Programming
