Maximising the Net Present Value for Resource-Constrained Project Scheduling

@inproceedings{Schutt2012MaximisingTN,
  title={Maximising the Net Present Value for Resource-Constrained Project Scheduling},
  author={Andreas Schutt and Geoffrey Chu and Peter J. Stuckey and Mark Wallace},
  booktitle={CPAIOR},
  year={2012}
}
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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 25 references

The payment scheduling problem

  • R. C. Grinold
  • Naval Research Logistics Quarterly 19(1), 123–136
  • 1972
Highly Influential
4 Excerpts

A scatter search heuristic for maximising the net present value of a resourceconstrained project with fixed activity cash flows

  • M. Vanhoucke
  • International Journal of Production Research 48(7…
  • 2010

Resource-constrained construction project scheduling model for profit maximization considering cash flow

  • S. S. Liu, C. J. Wang
  • Automation in Construction 17(8), 966–974
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…