Show/Hide Menu
Hide/Show Apps
anonymousUser
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
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Linear programming based approaches for the discrete time/cost trade-off problem in project networks
Date
2010-04-01
Author
Hafizoglu, A. B.
Azizoğlu, Meral
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
6
views
0
downloads
Cite This
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 project duration. To solve the Deadline Problem, we propose optimization and approximation algorithms that are based on the optimal Linear Programming Relaxation solutions. Our computational results from large-sized problem instances reveal the satisfactory behaviour of our algorithms. Journal of the Operational Research Society (2010) 61, 676-685. doi: 10.1057/jors.2009.20 Published online 25 March 2009
Subject Keywords
Marketing
,
Management Science and Operations Research
,
Strategy and Management
,
Management Information Systems
URI
https://hdl.handle.net/11511/47533
Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
DOI
https://doi.org/10.1057/jors.2009.20
Collections
Department of Industrial Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. B. Hafizoglu and M. Azizoğlu, “Linear programming based approaches for the discrete time/cost trade-off problem in project networks,”
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
, vol. 61, no. 4, pp. 676–685, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47533.