Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199603)43:2<169::AID-NAV2>3.0.CO;2-8" /><169::AID-NAV2>3.0.CO;2-8 10.1002/(SICI)1520-6750(199603)43:2<169::AID-NAV2>3.0.CO;2-8zbMath0868.90134OpenAlexW2087958068MaRDI QIDQ5688016

Awi Federgruen, Michal Tzur

Publication date: 6 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199603)43:2<169::aid-nav2>3.0.co;2-8

zbMATH Keywords

machine schedulingacyclic networksequential planningcombined inventory and routing problemsmulti-item joint replenishment systems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (7)

Computing minimal forecast horizons: an integer programming approach ⋮ Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities ⋮ Effective information for offline stochastic feedback and optimal control of dynamic systems ⋮ Approximate receding horizon approach for Markov decision processes: average reward case ⋮ Effective information horizon length in measuring off-line performance of stochastic dynamic systems ⋮ Solvability in infinite horizon optimization ⋮ New lot-sizing formulations for less nervous production schedules

This page was built for publication: Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future