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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Performance of the heuristic procedures for constrained projects with progress payments
Date
1997-11-01
Author
Sepil, C
Ortac, N
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
214
views
0
downloads
Cite This
All large scale resource constrained projects involve cash flows occurring during their life cycle. Several recent studies consider the problem of scheduling projects to maximise the net present value (NPV) of these cash flows. Their basic common assumption is that cash flows are mainly associated with specific events and they occur at event realisation times. An alternative assumption, which can be more realistic, is that cash inflows occur periodically, for example every month; as progress payments. This article considers the problem of maximising NPV given the alternative assumption. Three different heuristic rules are developed. The performance of these heuristic rules is analysed through a full factorial experiment with 108 scheduling conditions. The results indicate that three rules provide near-optimal schedules with respect to NPV maximisation while producing time schedules that do not delay the project completion time extensively.
Subject Keywords
Marketing
,
Management Science and Operations Research
,
Strategy and Management
,
Management Information Systems
URI
https://hdl.handle.net/11511/65427
Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
DOI
https://doi.org/10.1057/palgrave.jors.2600458
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
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...
Integrated framework to investigate value innovations
Dikmen Toker, İrem; Birgönül, Mustafa Talat (American Society of Civil Engineers (ASCE), 2005-04-01)
A conceptual framework has been developed to investigate value innovations within construction companies. A visual metaphor has been defined to model the innovation system where the elements of the model are objectives, strategies, environmental barriers/drivers, and organizational factors. The major idea is that none of the elements of the model alone can explain the innovative capability, and elements as well as their interrelations should be considered concurrently to investigate how the innovation syste...
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01)
This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
Linear programming based approaches for the discrete time/cost trade-off problem in project networks
Hafizoglu, A. B.; Azizoğlu, Meral (Informa UK Limited, 2010-04-01)
In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the pro...
Quantiative Methodology for Determination of Cost Contingency in International Projects
Sönmez, Rifat; Birgönül, Mustafa Talat (American Society of Civil Engineers (ASCE), 2007-01-01)
This paper presents a quantitative methodology to determine financial impacts of the risk factors during the bidding stages of international construction projects. Project and country data of 26 construction projects from 21 countries were collected for evaluation of the international risk factors. The factors impacting cost contingency were identified using correlation and regression analysis techniques. The results indicated that four factors had major contributions for explaining the variations in the co...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Sepil and N. Ortac, “Performance of the heuristic procedures for constrained projects with progress payments,”
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
, pp. 1123–1130, 1997, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65427.