Quantifying the risk of project delays with a genetic algorithm

International Journal of Production Economics

Volumn 170, Issue , 2015, Pages 34-44

  Pfeifer, Jeremy ^a   Barker, Kash ^a   Ramirez Marquez, Jose E ^b,c   Morshedlou, Nazanin ^a  

^a University of Oklahoma   (United States)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

^c SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

Genetic algorithm; Project network; Risk analysis

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; GENETIC ALGORITHMS; PROJECT MANAGEMENT; RISK ANALYSIS; RISK ASSESSMENT; STOCHASTIC SYSTEMS;

ALGORITHM SOLUTION; CONVENTIONAL TECHNIQUES; LARGE-SCALE PROJECTS; OPTIMIZATION PROBLEMS; PROJECT COMPLETION; PROJECT COMPLEXITY; PROJECT NETWORKS; PROJECT PERFORMANCE;

OPTIMIZATION;

EID: 84956971293     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2015.09.007     Document Type: Article

References (40)

1. Afshar-Nadjafi, B., Rahimi, A., Karimi, H., 2013. A genetic algorithm for mode identity and the resource constrained project scheduling problem. Sci. Iran. 20 (3), 824-831.
2. Agrawal, M.K., Elmaghraby, S.E., Herroelen, W.S., 1996. DAGEN: a generator of testsets for project activity nets. Eur. J. Oper. Res. 90 (2), 376-382.
3. Baar, T., Brucker., P., Knust, S., 1997. Tabu-Search Algorithms for the Resource- Constrained Project Scheduling Problem. University of Osnabruck, Germany, Technical Report.
4. Blanchard, B.S., 2008. System Engineering Management, 4th edition. Wiley, Hoboken, NJ.
5. Brucker, P., Knust, S., Schoo, A., Thiele, O., 1998. A branch-and-bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 107 (2), 272-288.
6. Chang, C.K., Christensen, M.J., Zhang, T., 2001. Genetic algorithms for project management. Ann. Softw. Eng. 11 (1), 107-139.
7. Chen, P.H., Weng, H.J., 2009. A two-phase GA model for resource-constrained project scheduling. Autom. Constr. 18 (4), 485-498.
8. Davis, L., 1985. Applying adaptive algorithms to epistatic domains. IJCAI 85, 162-164.
9. Dawood, N., 1998. Estimating project and activity duration: a risk management approach using network analysis. Constr. Manag. Econ. 16 (1), 41-48.
10. Demeulemeester, E., Vanhoucke, M., Herroelen, W., 2003. Rangen: a random net-work generator for activity-on-the-node networks. J. Sched. 6(1), 17-38.
11. Demeulemeester, E.L., Herroelen, W.S., 1992. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manag. Sci. 38 (12), 1803-1818.
12. Demeulemeester, E.L., Herroelen, W.S., 1997. new benchmark results for the resource-constrained project scheduling problem. Manag. Sci. 43 (11), 1485-1492.
13. Fang, C., Marle, F., Zio, E., Bocquet,J.-C., 2012. Network theory-based analysis of risk interactions in large engineering projects. Reliab. Eng. Syst. Saf. 106 (1), 1-10.
14. Golenko-Ginzburg, D., Gonik, A., 1997. Online control model for network con-struction projects. J. Oper. Res. Soc. 48 (2), 175-183.
15. Greenberg, D., Golenko-Ginzburg, D., 2010. Upon scheduling and controlling large- scale stochastic network projects. J. Appl. Quant. Methods 5 (3), 370-376.
16. Hartmann, S., 1998. A competitive genetic algorithm for resource-constrained project scheduling. Nav. Res. Logist. 45 (7), 733-750.
17. Hegazy, T., Petzold, K., 2003. Genetic optimization for dynamic project control. J. Constr. Eng. Manag. 129 (4), 396-404.
18. Herroelen, W.S., 1972. Resource-constrained project scheduling - the state of the art. Oper. Res. Q. 23, 261-275.
19. Jun-yan, L., 2012. Schedule uncertainty control: a literature review. Phys. Procedia 33, 1842-1848.
20. Kaplan, S., Garrick, B.J., 1981. On the quantitative definition of risk. Risk Anal. 1 (1), 11-27.
21. Ke, H., Liu, B., 2005. Project scheduling problem with stochastic activity duration times. Appl. Math. Comput. 168 (1), 342-353.
22. Kilic, M., Ulusoy, G., Serifoglu, F.S., 2008. A bi-objective genetic algorithm approach to risk mitigation in project scheduling. Int. J. Prod. Econ. 12 (1), 202-216.
23. Kohlmorgen, U., Schmeck, H., Haase, K., 1999. Experiences with fine-grained par-allel genetic algorithms. Ann. Oper. Res. 90 (0), 203-219.
24. Kolisch, R., Sprecher, A., 1997. PSPLIB - a project scheduling problem llibrary. Eur. J. Oper. Res. 96 (1), 205-216.
25. Kolisch, R., Sprecher, A., Drexl, A., 1995. Characterization and generation of a gen-eral class of resource-constrained project scheduling problems. Manag. Sci. 41 (10), 1693-1703.
26. Lee, J.-K., Kim, Y.-D., 1996. Search heuristics for resource-constrained project scheduling. J. Oper. Res. Soc. 47 (5), 678-689.
27. Leon, V.J., Ramamoorthy, B., 1995. Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling. Oper. Res. Spectr. 17 (2-3), 173-182.
28. Li, X., Kang, L., Tan, W., 2007. Optimized research of resource constrained project scheduling problem based on genetic algorithms. Advances in Computation and Intelligence. Lecture Notes in Computer Science. 4683, pp. 177-186.
29. Liu, Y.-C., Gao, H.-M., Yang, S.-M., Chuang, C.-Y., 2014. Application of genetic algo-rithm and fuzzy gantt chart to project scheduling with resource con-straints. Intelligent Computing Methodologies. Lecture Notes in Computer Science. 8589, pp. 241 -252.
30. Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L., 1998. An exact algorithm for the resource-constrained project scheduling problem based on a new mathe-matical formulation. Manag. Sci. 44 (5), 714-729.
31. Montoya-Torres, J.R., Gutierrez-Franco, E., Pirachican-Mayorga, C., 2010. Project scheduling with limited resources using a genetic algorithm. Int. J. Proj. Manag. 28 (6), 619-628.
32. Mori, M., Tseng, C.C., 1997. A genetic algorithm for multi-mode resource con-strained project scheduling problem. Eur. J. Oper. Res. 100 (1), 134-141.
33. Patterson, J.H., 1984. A comparison of exact approaches for solving the multiple constrained resource project scheduling problem. Manag. Sci. 30 (7), 854-867.
34. Proon, S., Jin, M.Z., 2011. A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem. Nav. Res. Logist. 58 (2), 73-82.
35. Sprecher, A., 1996. Solving the RCPSP Efficiently at Modest Memory Requirements. University of Kiel, Germany, Technical Report, Manuskripte aus den Instituten fur Betriebswirtschaftslehre 425.
36. Tavares, L.V., 1999. Advanced Models in Project Management. Kluwer, Boston, MA.
37. Tavares, L.V., Ferreira, J.A., Coelho, J.S., 2002. A comparative morphologic analysis of benchmark sets of project networks. Int. J. Proj. Manag. 20 (6), 475-485.
38. Valls, V., Ballestin, F., Quintanilla, S., 2008. A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 185 (2), 495-508.
39. Vanhoucke, M., Coelho, J., Debels, D., Maenhout, B., Tavares, L.V., 2008. An evalua-tion of the adequacy of project network generators with systematically sam-pled networks. Eur. J. Oper. Res. 187 (2), 511-524.
40. Wang, H., Lin, D., Li, M., 2005. A genetic algorithm for solving resource-constrained project scheduling problem. Advances in Natural Computation. Lecture Notes in Computer Science. 3612, pp. 185-193.