Article ID: | iaor19972277 |
Country: | United Kingdom |
Volume: | 33 |
Issue: | 5 |
Start Page Number: | 55 |
End Page Number: | 65 |
Publication Date: | Mar 1997 |
Journal: | Computers & Mathematics with Applications |
Authors: | Zhang A.X., Guu Sy-Ming |
Keywords: | programming: dynamic |
The authors study the structural properties of the multiple lot-sizing problem with a rigid demand and a generally distributed yield. This problem arises in unreliable production systems and is formulated as a stochastic dynamic program. The authors obtain partial characterizations of the optimal cost function and the optimal run size, and show that the monotonicity of the optimal run size is related to the monotonicity of a conditional yield distribution. They also consider the computational aspect for solving the multiple lot-sizing problem and provide upper bounds on the optimal cost and optimal run size, which are used to reduce the search ranges in a numerical solution procedure.