Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models

DOI10.1287/mnsc.41.5.874zbMath0843.90037OpenAlexW2048543781MaRDI QIDQ4865417

Awi Federgruen, Michal Tzur

Publication date: 13 February 1996

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a38a20f3876d819c1b4544bf5bd9550b628d65e9

zbMATH Keywords

dynamic planningminimal forecast horizonssingle-item dynamic lot-sizing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items

Computing minimal forecast horizons: an integer programming approach ⋮ Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities ⋮ Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes ⋮ A simplex algorithm for minimum-cost network-flow problems in infinite networks ⋮ Lot sizing and scheduling -- survey and extensions