Project time-cost analysis under generalised precedence relations

Advances in Engineering Software

Volumn 35, Issue 10-11, 2004, Pages 715-724

  Sakellaropoulos, S ^a   Chassiakos, A P ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Linear programming; Optimisation; Project crashing; Project planning; Project structure; Time cost trade off

Indexed keywords

CONSTRAINT THEORY; COSTS; GENETIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PLANNING; PROBLEM SOLVING; PROJECT MANAGEMENT;

PROJECT CRASHING; PROJECT PLANNING; PROJECT STRUCTURE; TIME-COST TRADE-OFF;

SOFTWARE ENGINEERING;

EID: 7544238250     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2004.03.017     Document Type: Article

References (21)

1. Perera S. Linear programming solution to network compression. ASCE J Constr Div. 106:1980;315-327.
2. Bartusch M., Möhring R.H., Radermacher F.J. Scheduling project networks with resource constraints and time windows. Ann Oper Res. 16:1988;201-240.
3. Patterson JH, Slowinski R, Talbot FB, Weglarz, J. An algorithm for a general class of precedence and resource constrained scheduling problems. Advances in project scheduling. Amsterdam; 1989. p. 03-28.
4. Shtub A., Bard J., Globerson S. Project management: engineering, technology and implementations. 1994;Prentice Hall, Englewood Cliffs, NJ. p. 382-92.
5. Liu L., Burns S.A., Feng C.W. Construction time-cost trade-off analysis using LP/IP hybrid method. ASCE J Constr Eng Manage. 121:(4):1995;446-454.
6. Parikh S.C., Jewell W.S. Decomposition of project networks. Manage Sci. 11:1965;444-459.
7. Crowston W.B., Decision C.P.M. Network reduction and solution. Oper Res Quart. 21:(4):1970;435-452.
8. Robinson D.R. A dynamic programming solution to cost-time trade-off for CPM. Manage Sci. 22:(2):1975;158-166.
9. Panagiotakopoulos D. Cost-time model for large CPM project networks. ASCE J Constr Div. 103:1977;201-211.
10. De P., Dunne E.J., Ghosh J.B., Wells C.E. The discrete time-cost trade-off problem revisited. Eur J Oper Res. 81:1995;225-238.
11. Chassiakos A.P., Samaras C.I., Theodorakopoulos D.D. An integer programming method for CPM time-cost analysis. Comput Model Eng Sci. 4:(1):2000;9-18.
12. Feng C.W., Liu L., Burns S.A. Using genetic algorithms to solve construction time-cost trade-off problems. ASCE J Comput Civil Eng. 11:(3):1997;184-189.
13. Li H., Cao J.N., Love P.E.D. Using machine learning and genetic algorithms to solve time-cost trade-off problems (MLGAS). ASCE J Constr Eng Manage. 125:(5):1999;347-353.
14. Leu S.S., Yang C.H. GA-based multicriteria optimal model for construction scheduling. J Constr Eng Manage. 125:(6):1999;420-427.
15. Charnes A., Cooper W. Chance-constrained programming. Manage Sci. 6:1959;73-79.
16. Coskunoglu O. Optimal probabilistic compression of PERT networks. ASCE J Constr Eng Manage. 110:(4):1984;437-446.
17. Dodin B.N. Bounding the project completion time distribution in PERT networks. Oper Res. 33:1985;862-881.
18. Weiss G. Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability. Oper Res. 34:(4):1986;595-605.
19. Feng C.W., Liu L., Burns S.A. Stochastic construction time-cost trade-off analysis. ASCE J Comput Civil Eng. 14:(2):2000;117-126.
20. Elmaghraby S.E., Kamburowski J. The analysis of activity networks under generalized precedence relations. Manage Sci. 38:1992;1245-1263.
21. Neumann K., Zhan J. Heuristics for the minimum project duration problem with minimal and maximal time lags under fixed resource constraints. J Intell Manuf. 6:1995;145-154.