haku: @author Yang, K. / yhteensä: 4
viite: 3 / 4
| Tekijä: | Yang, K. Talbot, F. Patterson, J. |
| Otsikko: | Scheduling a project to maximize its net present value: an integer programming approach |
| Lehti: | European Journal of Operational Research
1993 : JAN 22, VOL. 64:2, p. 188-198 |
| Asiasana: | SCHEDULING NET PRESENT VALUE INTEGER PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | The authors describe an integer programming algorithm for determining scheduled start and finish times for the activities of a project subject to resource limitations during each period of the schedule duration. The objective is to maximize the net present value of the project to the firm. A depth-first branch and bound solution procedure searches over the feasible set of finish or completion times for each of the activities of the project. Computational experience reported demonstrates the efficacy of the approach. |
SCIMA