Scheduling a Project to Maximise Its Net Present Value: An Integer Programming Approach
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 bran...
Saved in:
Main Authors: | Yang, Kum Khiong, Talbot, F.B., Patterson, J. H. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1993
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2230 https://doi.org/10.1016/0377-2217(93)90176-n |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Scheduling a project to maximize its net present value: An integer programming approach
by: Yang, K.K., et al.
Published: (2013) -
A Comparison of Stochastic Scheduling Rules for Maximising Project Net Present Value
by: Yang, Kum Khiong, et al.
Published: (1995) -
A comparison of stochastic scheduling rules for maximizing project net present value
by: Yang, K.K., et al.
Published: (2013) -
Project options valuation with net present value and decision tree analysis
by: DE REYCK, Bert, et al.
Published: (2008) -
Effects of Erroneous Estimation of Activity Durations on Scheduling and Dispatching a Single Project
by: Yang, Kum Khiong
Published: (1996)