Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities
DOI10.1016/J.COR.2013.06.007zbMATH Open1348.90029OpenAlexW2078343178MaRDI QIDQ336647FDOQ336647
Authors: J. Sicilia, José M. Gutiérrez, Marcos Colebrook, Beatriz Abdul-Jalbar 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.007
Recommendations
- A new heuristic approach for the multi-item dynamic lot sizing problem
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- A new characterization for the dynamic lot size problem with bounded inventory
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- 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
- Single item lot sizing problems
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Improved Algorithms for Economic Lot Size Problems
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A new characterization for the dynamic lot size problem with bounded inventory
- A polynomial algorithm for the production/ordering planning problem with limited storage
Cited In (2)
Uses Software
This page was built for publication: Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336647)
