Advertisement
Published in:
2012 | OriginalPaper | Chapter
Maximising the Net Present Value for Resource-Constrained Project Scheduling
Authors : Andreas Schutt, Geoffrey Chu, Peter J. Stuckey, Mark G. Wallace
Published in: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Resource-constrained Project Scheduling Problem (R
cpsp
), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (R
cpspDc
) is to find a schedule which maximises the net present value (discounted cash flow), when every activity has a given cash flow associated with it. Given the success of lazy clause generation (L
cg
) approaches to solve R
cpsp
with and without generalised precedence relations it seems worthwhile investigating L
cg
’s use on R
cpspdc
. To do so, we must construct propagators for the net-present-value constraint that explain their propagation to the L
cg
solver. In this paper we construct three different propagators for net-present-value constraints, and show how they can be used to rapidly solve R
cpspDc
.