The Net Present Value
Download the executables and data instances to solve various project scheduling problems with net present value optimization
On this webpage, you can download the executables for various types of project scheduling problem where the objective is to maximize the net present value. The specific details of the algorithms for the different executables can be found in the references mentioned at the bottom of each subsection.
1. The unconstrained project scheduling problem with discounted cash flows (max-npv problem)
Reference:
This problem type schedules project activities with a known duration and cash flows (either positive or negative) within the pre-specified precedence relations such that the net present value is maximized. The technological precedence relations can be minimal precedence relations (the max-npv problem) or a mix of minimal and maximal relations (the max-npv-gpr problem, with gpr an abbreviation for generalized precedence relations).
2. The resource-constrained project scheduling problem with discounted cash flows (RCPSPDC)
Reference:
The RCPSPCD schedules project activities with a known duration and cash flows (either positive or negative) within the pre-specified minimal precedence relations and within the presence of limited renewable resource constraints such that the net present value is maximized.
2.1 An exact branch-and-bound procedure (2001)
An exact branch-and-bound procedure has been developed and published in 2001 in Management Science. The procedure is based on the branching scheme of Icmeli et al. () and extended with the subset dominance rule originally proposed by De Reyck and Herroelen (). The problem instances of the Management Science paper contain 10, 20, 30, 40 and 50 activities and has been used in the Vanhoucke et al. (2001) reference below
2.2 A heuristic scatter search procedure (2006)
Reference:
In 2006, a scatter search procedure to solve the RCPSPDC has been developed in order to solve larger sized problem instances. The scatter search procedure has been tested on a new problem set containing networks with 25, 50, 75 and 100 instances. Each network has been extended with cash flows (both positive and negative) as displayed in the cash flow files and a project deadline. All data instances, an information file and solutions can be downloaded from this page. More information can be found in Vanhoucke (2006).