scientific article; zbMATH DE number 3885632
From MaRDI portal
Publication:3220331
[For the entire collection see Zbl 0549.00029.] This paper is devoted to the search of planning horizons for production planning models in the case of concave costs. The backward dynamic programming formulation is used. This approach, associated with a new result, allows: (1) to simplify an algorithm proposed elsewhere in order to obtain an optimal solution for the finite horizon problems. (2) to obtain an algorithm which leads to a planning horizon for a wide range of cases. We also give examples.
Recommendations
- scientific article; zbMATH DE number 3915978
- Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model
- Infinite horizon production planning in time-varying systems with convex production and inventory costs
- scientific article; zbMATH DE number 31719
- scientific article; zbMATH DE number 3883089
Cited in
(10)- A stochastic programming approach for planning horizons of infinite horizon capacity planning problems
- Long horizon versus short horizon planning in dynamic optimization problems with incomplete information
- Infinite horizon production planning in time-varying systems with convex production and inventory costs
- scientific article; zbMATH DE number 3883089 (Why is no real title available?)
- scientific article; zbMATH DE number 3862891 (Why is no real title available?)
- scientific article; zbMATH DE number 3900467 (Why is no real title available?)
- scientific article; zbMATH DE number 3915978 (Why is no real title available?)
- Strong decision and forecast horizons in a convex production planning problem
- scientific article; zbMATH DE number 31719 (Why is no real title available?)
- Strong planning and forecast horizons for a model with simultaneous price and production decisions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220331)