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.874MaRDI QIDQ4865417zbMATH OpenOpenAlexFDO

Authors 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) Dynamic programming (90C39) Inventory, storage, reservoirs (90B05)

Recommendations

• Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
• Forecast Horizons in the Discounted Dynamic Lot Size Model
• Minimal forecast horizon procedures for dynamic lot size models
• Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
• Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand

Cited in

(12)

• Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
• Computing minimal forecast horizons: an integer programming approach
• Solving nonstationary infinite horizon dynamic optimization problems
• Dynamic lot-size model and forecast horizon study for two products under joint production and lost sales
• Lot sizing and scheduling -- survey and extensions
• scientific article; zbMATH DE number 3898634 (Why is no real title available?)
• Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand
• scientific article; zbMATH DE number 3887432 (Why is no real title available?)
• Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities
• Minimal forecast horizon procedures for dynamic lot size models
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865417)