| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 481497 | European Journal of Operational Research | 2009 | 10 Pages |
Abstract
Standard LPs, widely used for planning in the processing industry, are powerful tools for making economic decisions, but do not cover time relationships inside the planning timeframe. To include sequence-dependent issues within the optimization process, an algorithmic extension to the LP was developed. DPX (Dynamic Programming Extension) is used to solve a whole class of problems that are dynamic in time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
F. Höfferl, D. Steinschorn,