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

190
views

81
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

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 deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs Bayındır, Zeynep Pelin; Frenk, J. B. G. (Elsevier BV, 2007-05-16) We present a thorough analysis of the economic production quantity model with shortages under a general inventory cost rate function and piecewise linear concave production costs. Consequently, an effective solution procedure, particularly useful for an approximation scheme, is proposed. A computational study is appended to illustrate the performance of the proposed solution procedure.
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 ...
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty Solyali, Oguz; Cordeau, Jean-Francois; Laporte, Gilbert (2016-04-01) This study considers a basic inventory management problem with nonzero fixed order costs under interval demand uncertainty. The existing robust formulations obtained by applying well-known robust optimization methodologies become computationally intractable for large problem instances due to the presence of binary variables. This study resolves this intractability issue by proposing a new robust formulation that is shown to be solvable in polynomial time when the initial inventory is zero or negative. Becau...

Citation Formats

A. Cömert, “A Project payment scheduling problem with discounted cash flows,” M.S. - Master of Science, Middle East Technical University, 2014.