haku: @indexterm Dynamic programming / yhteensä: 309
viite: 60 / 309
| Tekijä: | Demeulemeester, E. Herroelen, W. Elmaghraby, S. |
| Otsikko: | Optimal procedures for the discrete time/cost trade-off problem in project networks |
| Lehti: | European Journal of Operational Research
1996 : JAN 6, VOL. 88:1, p. 50-68 |
| Asiasana: | PROJECT MANAGEMENT DYNAMIC PROGRAMMING OPERATIONAL RESEARCH |
| Kieli: | eng |
| Tiivistelmä: | The authors describe two algorithms, based on dynamic programming logic, for optimally solving the discrete time/cost trade-off problem (DTCTP) in deterministic activity-on-arc networks of the CPM type, where the duration of each activity is a discrete, nonincreasing function of the amount of a single nonrenewable resource committed to it. The first algorithm is based on a procedure proposed by Bein, Kamburowski and Stallmann for finding the minimal number of reductions necessary to transform a general network to a series-parallel network. |
SCIMA