An efficient algorithm for the dynamic economic lot size problem

DOI10.1016/0305-0548(92)90004-OzbMath0773.90022OpenAlexW2039273684MaRDI QIDQ1206386

R. Maman, M. Yadin, Boaz Golany

Publication date: 1 April 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(92)90004-o

zbMATH Keywords

dynamic economic lot size problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Extensions of simple eyeballing dynamic lot sizing heuristics. ⋮ A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale

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
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Contraction Mappings in the Theory Underlying Dynamic Programming
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

This page was built for publication: An efficient algorithm for the dynamic economic lot size problem