Maximising the net present value for resource-constrained project scheduling

Authors:
Andreas Schutt;Geoffrey Chu;Peter J. Stuckey;Mark G. Wallace
Affiliations:
Department of Computing and Information Systems, National ICT Australia, The University of Melbourne, Victoria, Australia;Department of Computing and Information Systems, National ICT Australia, The University of Melbourne, Victoria, Australia;Department of Computing and Information Systems, National ICT Australia, The University of Melbourne, Victoria, Australia;Faculty of Information Technology, Monash University, Victoria, Australia
Venue:
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2012

Citing 13
Cited 2

A branch-and-bound procedure for the multiple resource-constrained project scheduling problem

Management Science
Optimal speedup of Las Vegas algorithms

Information Processing Letters
A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
New benchmark results for the resource-constrained project scheduling problem

Management Science
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Improving Linear Constraint Propagation by Changing Constraint Representation

Constraints
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints

Management Science
Efficient constraint propagation engines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Propagation via lazy clause generation

Constraints
Satisfiability of boolean formulas over linear constraints

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Explaining the cumulative propagator

Constraints
Extending chip in order to solve complex scheduling and placement problems

Mathematical and Computer Modelling: An International Journal

Maximising the net present value of large resource-constrained projects

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
There are no CNF problems

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Resource-constrained Project Scheduling Problem (Rcpsp), 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 (RcpspDc) 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 (Lcg) approaches to solve Rcpsp with and without generalised precedence relations it seems worthwhile investigating Lcg's use on Rcpspdc. To do so, we must construct propagators for the net-present-value constraint that explain their propagation to the Lcg solver. In this paper we construct three different propagators for net-present-value constraints, and show how they can be used to rapidly solve RcpspDc.