Article ID: | iaor2003555 |
Country: | Germany |
Volume: | 54 |
Issue: | 2 |
Start Page Number: | 259 |
End Page Number: | 278 |
Publication Date: | Jan 2001 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Stettner L., Duncan T.E., Pasik-Duncan B. |
Keywords: | programming: dynamic |
An optimal production planning for a stochastic manufacturing system is considered. The system consists of a single, failure-prone machine that produces a finite number of different products. The objective is to determine a rate of production that minimizes an average cost per unit time criterion where the demand is random. The results given in this paper are based on some large deviation estimates and the Hamilton–Jacobi–Bellman equations for convex functions.