Solving nonstationary infinite horizon stochastic production planning problems

DOI10.1016/S0167-6377(00)00049-3zbMath0971.90021OpenAlexW2071913753WikidataQ127207365 ScholiaQ127207365MaRDI QIDQ1593714

Robert L. Smith, Alfredo Daniel Garcia

Publication date: 25 January 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00049-3

zbMATH Keywords

production planningstochastic demandforecast horizonsplanning horizonsoptimal production decisions

Mathematics Subject Classification ID

Stochastic programming (90C15) Production models (90B30) Group preferences (91B10)

Related Items (4)

A stochastic programming approach for planning horizons of infinite horizon capacity planning problems ⋮ A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices. ⋮ A pseudo-stochastic approach for optimal decision making under limited information: a case of an aggregate production system ⋮ Monotonic robust optimal control policies for the time-quality trade-offs in concurrent new product development (NPD)

Cites Work

• Unnamed Item
• Dynamic Inventory Policy with Varying Stochastic Demands
• Infinite Horizon Production Planning in Time-Varying Systems with Convex Production and Inventory Costs
• Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
• Stochastic Monotonicity and Stationary Distributions for Dynamic Economies
• Stochastic Horizons for the Aggregate Planning Problem
• Minimizing a Submodular Function on a Lattice
• Optimality of (s, S) Policies in Inventory Models with Markovian Demand
• Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand Classes

This page was built for publication: Solving nonstationary infinite horizon stochastic production planning problems