Please use this identifier to cite or link to this item:
|Title:||Scheduling a project to maximize its net present value: An integer programming approach|
|Authors:||Yang, K.K. |
Net present value
|Citation:||Yang, K.K.,Talbot, F.B.,Patterson, J.H. (1993). Scheduling a project to maximize its net present value: An integer programming approach. European Journal of Operational Research 64 (2) : 188-198. ScholarBank@NUS Repository.|
|Abstract:||We 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. Fathoming criteria based upon the concept of a network cut originally developed to solve the duration minimization version of this problem are extended in this paper to solve the net present value problem. These fathoming decision rules prevent many potentially inferior solutions from being explicitly evaluated. Computational experience reported demonstrates the efficacy of the approach. © 1993.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.