Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
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
36
views
20
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
Suggestions
OpenMETU
Core
A branch and bound algorithm for project scheduling problem with discounted cash flows
COMERT, ALİCAN; Azizoğlu, Meral (2016-12-01)
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 progra...
A resource investment problem with time/resource trade-offs
Colak, Erdem; Azizoğlu, Meral (Informa UK Limited, 2014-05-01)
In this study, we consider a Resource Investment Problem with time/resource trade-offs in project networks. We assume that there is a single renewable resource and the processing requirement of an activity can be reduced by investing extra resources. Our aim is to minimize the maximum resource usage, hence, the total amount invested for the single resource, while meeting the pre-specified deadline. We formulate the problem as a mixed integer linear model and find optimal solutions for small-sized problem in...
A two-echelon inventory model with stock-dependent demand and variable holding cost for deteriorating items
Pervin, Magfura; null, null; Kumar Roy, Sankar; Wilhelm Weber, Gerhard (American Institute of Mathematical Sciences (AIMS), 2017)
In this study, we develop an inventory model for deteriorating items with stock dependent demand rate. Shortages are allowed to this model and when stock on hand is zero, then the retailer offers a price discount to customers who are willing to back-order their demands. Here, the supplier as well as the retailer adopt the trade credit policy for their customers in order to promote the market competition. The retailer can earn revenue and interest after the customer pays for the amount of purchasing cost to ...
Resource investment problem with time/resource trade-offs
Çolak, Erdem; Azizoğlu, Meral; Department of Industrial Engineering (2011)
In this study, we consider a resource investment problem with time/resource trade-offs in project environments. We assume each mode of an activity is characterized by its processing time and resource requirement and there is a single renewable resource. Our aim is to minimize the maximum resource usage, hence the total amount invested for the single resource. We formulate the problem as a mixed integer linear model and find optimal solutions for small sized problem instances. We propose several lower boundi...
Analysis of a deterministic demand production/inventory system under nonstationary supply uncertainty
Gullu, R; Onol, E; Erkip, N (Informa UK Limited, 1997-08-01)
In this article we investigate a periodic review inventory model under deterministic dynamic demand and supply unavailability. In a given period, supply is either available or completely unavailable with given probabilities. Supply unavailability probabilities are nonstationary over time. We show the optimality of an order-up-to level policy, and obtain a newsboy-like formula that determines the optimal order-up-to levels. Our formula would provide guidence as to the appropriate amount of inventory to stock...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Cömert, “A Project payment scheduling problem with discounted cash flows,” M.S. - Master of Science, Middle East Technical University, 2014.
