Exact and Heuristic Methods for the Resource-Constrained Net Present Value Problem
An important variant of the resource-constrained project scheduling problem is to maximise the net present value. Significant progress has been made recently on this problem for both exact and inexact methods. The lazy clause generation based constraint programming approach is the state of the art among the exact methods and is briefly discussed. The performance of the Lagrangian relaxation based decomposition method is greatly improved when the forward-backward improvement heuristic is employed. A novel decomposition approach is designed for very large industrial problems which can make full use of the parallel computing capability of modern personal computers. Computational results are also presented to compare different approaches on both difficult benchmark problems and large industrial applications.
KeywordsConstraint programming Lagrangian relaxation Net present value Project scheduling Resource constraints
NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centre of Excellence program.
- Dósa G (2004) Graham’s example is the only tight one for P | | Cmax. Ann Univ Sci Budapest Sec Math 47:207–210Google Scholar
- Gu H, Xi Y, Tao J (2007) Randomized Lagrangian heuristic based on Nash equilibrium for large scale single machine scheduling problem. In: Proceedings of the 22nd IEEE international symposium on intelligent control, pp 464–468Google Scholar
- Gu H, Stuckey P, Wallace M (2012) Maximising the net present value of large resource-constrained projects. In: Milano M (ed) CP 2012. Lecture notes in computer science, vol 7514. Springer, Heidelberg, pp 767–781Google Scholar
- Gu H, Schutt A, Stuckey P (2013) A Lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects. In: Gomes C, Sellmann M (eds) CPAIOR 2013. Lecture notes in computer science, vol 7874. Springer, Heidelberg, pp 340–346Google Scholar
- Karypis G (2011) METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, Version 5.0. URL http://glaros.dtc.umn.edu/gkhome/views/metis
- Neumann K, Zimmermann J (2002) Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Cent Eur J Oper Res 10(4):357–380Google Scholar
- Schulte C, Stuckey PJ (2008) Efficient constraint propagation engines. ACM Trans Program Lang Syst 31(1):1–43 (Article No. 2)Google Scholar
- Schutt A, Chu G, Stuckey PJ, Wallace MG (2012) Maximizing the net-present-value for resource constrained project scheduling. In: Beldiceanu N, Jussien N, Pinson E (eds) CPAIOR 2012. Lecture notes in computer science, vol 7298. Springer, Heidelberg, pp 362–378Google Scholar
- Siek JG, Lee LQ, Lumsdaine A (2001) The boost graph library: user guide and reference manual. Addison-Wesley, BostonGoogle Scholar