A branch and bound algorithm for project scheduling problem with discounted cash flows. (2016)

• Record Type: Journal Article
• Authors: Comert, Alican; Azizoglu, Meral
• Is Part Of: International journal of planning and scheduling. Volume 2:Number 3(2016)
• Page Start: 233
• Page End: 251
• Publication Date: 2016
• Subjects: project scheduling -- discounted cash flow -- DCF -- branch and bound algorithm -- project payment models -- activity completion times -- net present value -- NPV -- client payments -- activity costs -- mixed integer nonlinear programming -- MNLIP; Production scheduling -- Periodicals; Mathematical statistics -- Periodicals; Operations research -- Periodicals; 658.53
• Languages: English
• ISSNs: 2044-494X

Abstract

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.