Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
A Project payment scheduling problem with discounted cash flows
Download
index.pdf
Date
2014
Author
Cömert, Alican
Metadata
Show full item record
Item Usage Stats
5
views
6
downloads
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