Dynamic capacitated lot sizing with random demand and dynamic safety stocks
AbstractWe present a stochastic version of the single-level, multi-product dynamic lotsizing problem subject to a capacity constraint. A production schedule has to be determined for random demand so that expected costs are minimized and a constraint based on a new backlog-oriented $\delta$-service-level measure is met. This leads to a non-linear model that is approximated by two different linear models. In the first approximation, a scenario approach based on random samples is used. In the second approximation model, the expected values of physical inventory and backlog as functions of the cumulated production are approximated by piecewise linear functions. Both models can be solved to determine efficient, robust and stable production schedules in the presence of uncertain and dynamic demand. They lead to dynamic safety stocks that are endogenously coordinated with the production quantities. A numerical analysis based on a set of (artificial) problem instances is used to evaluate the relative performance of the two different approximation approaches. We furthermore show under which conditions precise demand forecasts are particularly useful from a production-scheduling perspective.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät in its series Diskussionspapiere der Wirtschaftswissenschaftlichen Fakultät der Leibniz Universität Hannover with number dp-465.
Length: 27 pages
Date of creation: Feb 2011
Date of revision:
lot sizing; random demand; dynamic safety stocks;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-03-05 (All new papers)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dietrich, Karl).
If references are entirely missing, you can add them using this form.