| Autor: |
Comert, Alican, Azizoglu, Meral |
| Zdroj: |
International Journal of Planning and Scheduling; 2016, Vol. 2 Issue: 3 p233-251, 19p |
| Abstrakt: |
In this study, we consider a project payment model with discounted cash flows. We assume that the client payment times are defined in the project contract. The activities are characterised by their processing times and costs that are incurred at their completion times. Our problem is to find the activity completion times so as to maximise the net present value of the client payments and activity costs. We show that the problem is strongly NP-hard. We formulate the problem as a mixed integer nonlinear programming model and propose a branch and bound algorithm that employs efficient lower and upper bounding mechanisms. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
