Maximising the net present value of large resource-constrained projects

Authors:
Hanyu Gu;Peter J. Stuckey;Mark G. Wallace
Affiliations:
National ICT Australia, Victoria Research Laboratory, The University of Melbourne, Victoria, Australia;National ICT Australia, Department of Computing and Information Systems, The University of Melbourne, Victoria, Australia;Monash University, Victoria, Australia
Venue:
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Year:
2012

Citing 9
Cited 0

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

Management Science
Min-cut clustering

Mathematical Programming: Series A and B
Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low-power design
New benchmark results for the resource-constrained project scheduling problem

Management Science
New bundle methods for solving Lagrangian relaxation dual problems

Journal of Optimization Theory and Applications
On Implementing Push-Relabel Method for the Maximum Flow Problem

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints

Management Science
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
Maximising the net present value for resource-constrained project scheduling

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey resource constraints and precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of this problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow). Large industrial applications can require thousands of activities to be scheduled over a long time span. The largest case we have (from a mining company) includes about 11,000 activities spanning over 20 years. We apply a Lagrangian relaxation method for large RcpspDc to obtain both upper and lower bounds. To overcome the scalability problem of this approach we first decompose the problem by relaxing as fewer as possible precedence constraints, while obtaining activity clusters small enough to be solved efficiently. We propose a hierarchical scheme to accelerate the convergence of the subgradient algorithm of the Lagrangian relaxation. We also parallelise the implementation to make better use of modern computing infrastructure. Together these three improvements allow us to provide the best known solutions for very large examples from underground mining problems.