Computational Technology Resources - CCP

M.M. Cusack, D. Richardson, "A Heuristic Method for Time Cost Trade Off in Precedence Networks", in B.H.V. Topping, M.C. Forde, H.W. Whittington, (Editors), "Proceedings of the International Conference on Civil and Structural Engineering Software and Applications for Macro and Mini Computers", Civil-Comp Press, Edinburgh, UK, pp 220-229, 1983.

Abstract

The time cost trade off problem which is solved is to compute, with accuracy appropriate to the inherent uncertainty of the model, the relationship between completion time and cost for projects which are describable by precedence networks of activities, where precedence may take any of the most common forms, either start-to-start, finish-to-finish, or finish-to-start, with lags, and the time cost relationship for each activity is only required to be monotone. The question of computational complexity is discussed in general for this type of problem. The heuristic method has computational complexity which tends to increase only linearly with project size, whereas integer linear programming and other known solution techniques have complexity which tends to increase at least with the square of the number of activities. Thus a heuristic method is suitable for situations in which there are large projects, or the only available computers are small ones.

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

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 £70 +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: 1 PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON CIVIL AND STRUCTURAL ENGINEERING SOFTWARE AND APPLICATIONS FOR MACRO AND MINI COMPUTERS Edited by: B.H.V. Topping, M.C. Forde, H.W. Whittington Paper VII.6 A Heuristic Method for Time Cost Trade Off in Precedence Networks M.M. Cusack and D. Richardson Bristol Polytechnic purchase the full-text of this paper Full Bibliographic Reference for this paper M.M. Cusack, D. Richardson, "A Heuristic Method for Time Cost Trade Off in Precedence Networks", in B.H.V. Topping, M.C. Forde, H.W. Whittington, (Editors), "Proceedings of the International Conference on Civil and Structural Engineering Software and Applications for Macro and Mini Computers", Civil-Comp Press, Edinburgh, UK, pp 220-229, 1983. Abstract The time cost trade off problem which is solved is to compute, with accuracy appropriate to the inherent uncertainty of the model, the relationship between completion time and cost for projects which are describable by precedence networks of activities, where precedence may take any of the most common forms, either start-to-start, finish-to-finish, or finish-to-start, with lags, and the time cost relationship for each activity is only required to be monotone. The question of computational complexity is discussed in general for this type of problem. The heuristic method has computational complexity which tends to increase only linearly with project size, whereas integer linear programming and other known solution techniques have complexity which tends to increase at least with the square of the number of activities. Thus a heuristic method is suitable for situations in which there are large projects, or the only available computers are small ones. purchase the full-text of this paper (price £10) 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 £70 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions