haku: @indexterm allocation / yhteensä: 247
viite: 181 / 247
| Tekijä: | Toker, A. Kondakci, S. Erkip, N. |
| Otsikko: | Scheduling under a non-renewable resource constraint |
| Lehti: | Journal of the Operational Research Society
1991 : SEP, VOL. 42:9, p. 811-814 |
| Asiasana: | SCHEDULING ALLOCATION RESOURCE ALLOCATION |
| Kieli: | eng |
| Tiivistelmä: | The most common non-renewable constraint is a financial constraint. It is shown in the study that the special case of the non-renewable-resource-constrained scheduling problem is equivalent to the two-machine flowshop problem, which can be solved optimally in polynominal time. In the problem examined in the study jobs have arbitrary processing times and resource requirements. Unit supply of a resource is assumed at each time period. Performance criterion is makespan. The result of the study may also be used as a basis to develop approaches for problem environments of greater complexity. |
SCIMA