A Project payment scheduling problem with discounted cash flows

Date

2014

Author

Cömert, Alican

Metadata

Show full item record

Item Usage Stats

17
views

11
downloads

Cite This

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 characterized by their processing times and costs that are incurred at their completions. Our problem is to find the client payment amounts and activity completion times so as to minimize 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 solve small to moderate sized problem instances. For moderate to large sized problem instances, we propose a branch and bound algorithm that employs efficient lower and upper bounding mechanisms.

Subject Keywords

Project management., Production scheduling., Discounted cash flow., Branch and bound algorithms.

URI

http://etd.lib.metu.edu.tr/upload/12617524/index.pdf
https://hdl.handle.net/11511/23751

Collections

Graduate School of Natural and Applied Sciences, Thesis