Article ID: | iaor1994447 |
Country: | United Kingdom |
Volume: | 20 |
Issue: | 5 |
Start Page Number: | 455 |
End Page Number: | 465 |
Publication Date: | Jun 1993 |
Journal: | Computers and Operations Research |
Authors: | Thompson Gerald L., Sandbothe Richard A. |
Keywords: | production, programming: dynamic |
In this paper the authors consider the lot size model for the production and storage of a single commodity with limitations on production capacity and storage capacity. There is also the possibility of not meeting demand, i.e. stockouts in the form of lost sales, at a penalty. The stockout option means that horizons can exist and permits the use of horizons to develop a forward algorithm for solving the problem. The forward algorithm is shown to be asymptotically linear in computational requirements, in contrast to the case for the classical lot size model which has exponential computing requirements. Besides the forward algorithm, a number of necessary conditions are derived which reduce the computational burden of solving the model.