| Tekijä: | Bannister, C. H. Kay, R. J. |
| Otsikko: | A rapid method for optimization of linear systems with storage. |
| Lehti: | Operations Research
1991 : MAR-APR, VOL. 39:2, p. 220-232 |
| Asiasana: | STORAGE DYNAMIC PROGRAMMING PRODUCTION SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | The systems considered in the paper consist of a single store and a production facility. Combining programming and dynamic programming concepts, a new exact optimization technique is presented, which optimizes the operation of the storage by solving a sequence of small linear programming problems rather than the much larger, time-staged problem. The method has a very simple graphical interpretation, yet is capable of solving complex problems of long duration. The model is shown to cover a wide variation of practical situations where a deterministic approximation is valid. |
SCIMA