Back to Search
Start Over
A STRUCTURAL METHOD OF COMPUTING PROJECT COST POLYGONS.
- Source :
- Management Science; Apr1963, Vol. 9 Issue 3, p394-404, 11p
- Publication Year :
- 1963
-
Abstract
- For a project that consists of numerous jobs subject to technological ordering restrictions the polygon representing project cost versus completion time is to be determined when the normal and crash completion times are known for each job and the cost of doing the job varies linearly between these times. A linear programming formulation of this problem was given by Keliey [1] and a network flow formulation by Fulkerson [2]. Since the traditional mathematical background of civil engineers includes neither linear programming nor network flow theory, these methods are not as widely used in the building industry as they deserve. This paper shows that Fulkerson's algorithm can be given a structural interpretation using concepts that are familiar to civil engineers. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00251909
- Volume :
- 9
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Management Science
- Publication Type :
- Academic Journal
- Accession number :
- 7450919
- Full Text :
- https://doi.org/10.1287/mnsc.9.3.394