| Tekijä: | Grossmann, W. |
| Otsikko: | A min cost flow solution for dynamic assignment problems in networks with storage devices |
| Lehti: | Management Science
1995 : JAN, VOL. 41:1, p. 83-93 |
| Asiasana: | NETWORKS DYNAMIC MODELS ASSIGNMENT PROBLEM |
| Kieli: | eng |
| Tiivistelmä: | The paper presents a minimum-cost flow approach for dynamic assignment procedures for networks with storage devices over time. Decision variables are diversion of flow at specific nodes and the stirage of material in buffers which have to meet upper and lower capacity constraints. Evaluation of a decision is based on utility functions which are assumed to be piecewise linear and concave. The solution is based on a transformation into a network flow problem as suggested by Kuczera (1989). |
SCIMA