A new characterization for the dynamic lot size problem with bounded inventory
From MaRDI portal
Publication:1869910
DOI10.1016/S0305-0548(01)00105-8zbMath1029.90006OpenAlexW2049240151MaRDI QIDQ1869910
Antonio Sedeño-Noda, José Miguel Gutiérrez, Marcos Colebrook, Joaquín Sicilia
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00105-8
Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)
Related Items
Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ A polynomial algorithm for the production/ordering planning problem with limited storage ⋮ Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ Improving inventory system performance by selective purchasing of buyers' willingness to wait ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ Just-in-Time Planning and Lot-Sizing ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Modeling industrial lot sizing problems: a review ⋮ Capacitated production planning with outsourcing in an OKP company ⋮ Warehouse sizing and inventory scheduling for multiple stock-keeping products ⋮ Joint optimization of dynamic lot and warehouse sizing problems ⋮ Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories ⋮ An efficient approach for solving the lot-sizing problem with time-varying storage capacities ⋮ Multi-item uncapacitated lot sizing problem with inventory bounds ⋮ Lot sizing with bounded inventory and lost sales ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory ⋮ A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test ⋮ Single item lot sizing problems
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
