Computational Technology Resources - CCP

A.P. Chassiakos, C.I. Samaras and D.D. Theodorakopoulos

Department of Civil Engineering, University of Patras, Greece

doi:10.4203/ccp.56.14.1

A.P. Chassiakos, C.I. Samaras, D.D. Theodorakopoulos, "An Algorithm for Determining the Optimal Duration of Large Projects", in B.H.V. Topping, (Editor), "Advances in Civil and Structural Engineering Computing for Practice", Civil-Comp Press, Edinburgh, UK, pp 449-454, 1998. doi:10.4203/ccp.56.14.1

Abstract

In project network analysis, a time-cost trade off problem appears with respect to project duration and cost to attain this duration. Identifying the most profitable option gets complicated when project activities have to be completed in a certain sequence and the resources involved have different prices for time. An algorithm for obtaining the optimal solution of such a problem in large projects is presented. The algorithm employs an integer programming formulation to determine the optimal duration of the project activities which result in a given project length. Among all feasible lengths, the one corresponding to the lowest execution cost is selected. The proposed algorithm is more efficient than previous methods and always arrives at the optimal solution.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £95 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 56 ADVANCES IN CIVIL AND STRUCTURAL ENGINEERING COMPUTING FOR PRACTICE Edited by: B.H.V. Topping Paper XIV.1 An Algorithm for Determining the Optimal Duration of Large Projects A.P. Chassiakos, C.I. Samaras and D.D. Theodorakopoulos Department of Civil Engineering, University of Patras, Greece doi:10.4203/ccp.56.14.1 purchase the full-text of this paper Full Bibliographic Reference for this paper A.P. Chassiakos, C.I. Samaras, D.D. Theodorakopoulos, "An Algorithm for Determining the Optimal Duration of Large Projects", in B.H.V. Topping, (Editor), "Advances in Civil and Structural Engineering Computing for Practice", Civil-Comp Press, Edinburgh, UK, pp 449-454, 1998. doi:10.4203/ccp.56.14.1 Abstract In project network analysis, a time-cost trade off problem appears with respect to project duration and cost to attain this duration. Identifying the most profitable option gets complicated when project activities have to be completed in a certain sequence and the resources involved have different prices for time. An algorithm for obtaining the optimal solution of such a problem in large projects is presented. The algorithm employs an integer programming formulation to determine the optimal duration of the project activities which result in a given project length. Among all feasible lengths, the one corresponding to the lowest execution cost is selected. The proposed algorithm is more efficient than previous methods and always arrives at the optimal solution. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £95 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions