Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities

DOI10.1016/j.cor.2013.06.007zbMath1348.90029OpenAlexW2078343178MaRDI QIDQ336647

Joaquín Sicilia, José Miguel Gutiérrez, Beatriz Abdul-Jalbar, Marcos Colebrook

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

zbMATH Keywords

heuristicsinventorystorage capacitysmoothing techniquemulti-item

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (2)

Scheduling the replenishment of just-in-time supermarkets in assembly plants ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity

Uses Software

• CPLEX

Cites Work

• A polynomial algorithm for the production/ordering planning problem with limited storage
• A new characterization for the dynamic lot size problem with bounded inventory
• Single item lot sizing problems
• 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
• 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
• Improved Algorithms for Economic Lot Size Problems

This page was built for publication: Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities