Heuristic Procedures for Multi-Item Inventory Planning with Limited Storage
- 1 June 1990
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 22 (2), 112-123
- https://doi.org/10.1080/07408179008964163
Abstract
The determination of replenishment quantities for multiple products with dynamic demand, subject to storage constraints, is addressed. A lower bound is obtained by solving the dual problem. Both subgradient optimization of the Lagrangean relaxation and LP relaxation of the convexified solution space are considered. Dantzig-Wolfe decomposition is used to solve the LP relaxation. A heuristic is proposed for the generation of feasible solutions obtained by modifying solutions created at each step of either subgradient optimization or Dantzig-Wolfe decomposition. An experimental investigation of 428 test problems indicates that the heuristic coupled with sub-gradient optimization gives consistently good solutions.Keywords
This publication has 24 references indexed in Scilit:
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's FormulationsManagement Science, 1986
- The Deterministic, Two-Product, Inventory System with Capacity ConstraintJournal of the Operational Research Society, 1982
- The Dynamic Lot-Sizing Problem for Multiple Items Under Limited CapacityA I I E Transactions, 1981
- A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problemJournal of Operations Management, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- HEURISTIC LOT‐SIZING PERFORMANCE IN A ROLLING‐SCHEDULE ENVIRONMENT*Decision Sciences, 1980
- A Dynamic Lot Sizing Algorithm with Capacity ConstraintsA I I E Transactions, 1975
- A Lower Bounding Structure for Lot-Size Scheduling ProblemsOperations Research, 1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Optimal Programming of Lot Sizes, Inventory and Labor AllocationsManagement Science, 1965