A forward algorithm and planning horizon procedure for the production smoothing problem without inventory
From MaRDI portal
Publication:595502
DOI10.1016/0377-2217(84)90104-8zbMath0527.90041OpenAlexW1980098062MaRDI QIDQ595502
Thomas E. Morton, Jay E. Aronson, Gerald L. Thompson
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90104-8
computational resultsperishable productsproduction smoothingdetermination of optimal planning horizonforward algorithm
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30)
Related Items (4)
A forward convex-simplex method ⋮ Computing minimal forecast horizons: an integer programming approach ⋮ A survey of dynamic network flows ⋮ Decision and forecast horizons in a stochastic environment: A survey
Cites Work
- Unnamed Item
- On Production Smoothing
- Smooth Patterns of Production
- Infinite-Horizon Dynamic Programming Models—A Planning-Horizon Formulation
- Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
- Planning Horizons for Production Smoothing with Deterministic Demands
- General Planning Horizons for Production Smoothing with Deterministic Demands
- Production Smoothing and Inventory Control
- Optimal Production Scheduling and Employment Smoothing with Deterministic Demands
- Decision and Horizon Rules for Stochastic Planning Problems: A Linear Example
This page was built for publication: A forward algorithm and planning horizon procedure for the production smoothing problem without inventory