Project Time-Cost Analysis under Generalised Precedence Relations

Author(s):  
S. Sakellaropoulos ◽  
A.P. Chassiakos

2004 ◽  
Vol 35 (10-11) ◽  
pp. 715-724 ◽  
Author(s):  
S. Sakellaropoulos ◽  
A.P. Chassiakos


2006 ◽  
Vol 24 (6) ◽  
pp. 529-535 ◽  
Author(s):  
Matthew J. Liberatore ◽  
Bruce Pollack-Johnson
Keyword(s):  


2019 ◽  
Vol 28 (1) ◽  
pp. 18-28
Author(s):  
Karel Doubravský ◽  
Radek Doskočil ◽  
Mirko Dohnal

This paper investigates the application of trend quantifiers of project time-cost analysis as a tool for decision-making support in the project management. Practical project management-related problems are solved under information shortages. It means that methods of statistical analysis cannot be easily used as they are based on the law of large numbers of observations. Numbers are information intensive quantifiers. The least information intensive quantifier is a trend; its values are increasing, constant, decreasing. If a derivative cannot be quantified by a trend, then nothing is known and therefore nothing can be analyzed/predicted. For this reason, the trend model M was created. The model M is based on a degraded set of differential equations or heuristics. A trend analysis of the model M is an evaluation of the relevant discrete set of solutions/scenarios S. A trend reconstruction is an evaluation of the model M if a (sub)set of scenarios S is given. The paper studies linear reconstruction, i.e. the model M is a set of linear differential equations. The trend reconstruction is partially reverse process to trend analysis. A case study has 7 variables (e.g. Project duration, Direct personnel costs, Indirect personal costs etc.) and the reconstructed set of linear differential equations has 7 equations. The set of 243 scenarios is obtained if this reconstructed set of trend linear equations is solved. Any future or past behavior of the model M can be described by a sequence of obtained scenarios.





1985 ◽  
Vol 9 (2) ◽  
pp. 98-104
Author(s):  
Daniel J. Macy ◽  
D. Sue Schafer


1991 ◽  
Vol 40 (5) ◽  
pp. 613-628 ◽  
Author(s):  
B. Qin ◽  
H.A. Sholl ◽  
R.A. Ammar


2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Hanying Wei ◽  
Zhixiong Su ◽  
Yuan Zhang

This study investigates the deadline of the discrete time-cost tradeoff problem (DTCTP-D) with generalized precedence relations (GPRs). This problem requires modes to be assigned to the activities of a project such that the total cost is minimized and the total completion time and the precedence constraints are satisfied. Anomalies under GPRs are irreconcilable with many current theories and methods. We propose a preprocessing technology, an equivalent simplification approach, which is an effective method for solving large-scale complex problems. We first study a way to deal with the anomalies under GPRs, such as the reduce (increase) in project completion as a consequence of prolonging (shortening) an activity, and discover relationships between time floats and path lengths. Then, based on the theories, we transform the simplification into a time float problem and design a polynomial algorithm. We perform the simplification and improve the efficiency of the solution by deleting redundant calculation objects.



2007 ◽  
Vol 64 (6) ◽  
pp. 342-345 ◽  
Author(s):  
David T. Harrington ◽  
G.D. Roye ◽  
Beth A. Ryder ◽  
Thomas J. Miner ◽  
Pamela Richardson ◽  
...  


Sign in / Sign up

Export Citation Format

Share Document