Resource-constrained critical path scheduling by a GRASP-based hyperheuristic

Journal of Computing in Civil Engineering

Volumn 26, Issue 2, 2012, Pages 204-213

  Anagnostopoulos, Konstantinos ^a   Koulinas, Georgios ^a  

^a DEMOCRITUS UNIVERSITY OF THRACE   (Greece)

Author keywords

Construction management; Optimization; Scheduling

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMMERCIAL PROJECTS; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL PROCEDURES; CONSTRUCTION FIELDS; CONSTRUCTION MANAGEMENT; CONSTRUCTION PROJECTS; CRITICAL PATHS; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; HYPER-HEURISTICS; HYPERHEURISTIC; OPTIMIZATION PROBLEMS; PRIORITY VALUES; RESOURCE-CONSTRAINED; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; SOFTWARE USE;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; CONSTRUCTION INDUSTRY; OPTIMIZATION; SCHEDULING;

GENETIC PROGRAMMING;

EID: 84859559015     PISSN: 08873801     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)CP.1943-5487.0000116     Document Type: Article

References (43)

1. Alvarez-Valdez, R., Crespo, R. E., Tamarit, J. M., and Villa, F. (2008). GRASP and path relinking for project scheduling under partially renewable resources. Eur. J. Oper. Res., 189 (3), 1153-1170. 10.1016/j.ejor.2006.06.073 0377-2217 (Pubitemid 351400561)
2. Anagnostopoulos, K. P., and Koulinas, G. K. (2010). A simulated annealing hyperheuristic for construction resource levelling. Constr. Manage. Econ, 28 (2), 163-175. 10.1080/01446190903369907
3. Blazewicz, J., Lenstra, J. K., and Rinnooy Kan, A. H. G. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Appl. Math., 5 (1), 11-24. 10.1016/0166-218X(83)90012-4 0166-218X
4. Boctor, F. F. (1996). Resource-constrained project scheduling by simulated annealing. Int. J. Prod. Res., 34 (8), 2335-2351. 10.1080/ 00207549608905028 0020-7543 (Pubitemid 126525300)
5. Bouleimen, K., and Lecocq, H. (2003). A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur. J. Oper. Res., 149 (2), 268-281. 10.1016/S0377-2217(02)00761-0 0377-2217
6. Brucker, P., Knust, S., Schoo, A., and Thiele, O. (1998). A branch-and-bound algorithm for the resource constrained project scheduling problem. Eur. J. Oper. Res., 107 (2), 272-288. 10.1016/S0377-2217(97)00335-4 0377-2217 (Pubitemid 128407543)
7. Burke, E. K., Kendall, G., Landa-Silva, D., O'Brien, R., and Soubeiga, E. (2005). An ant algorithm hyper-heuristic for the project presentation scheduling problem. Proc., 2005 IEEE Congress on Evolutionary Computation (CEC 2005), IEEE Computer Society Press, Edinburgh, Scotland, 2263-2270. (Pubitemid 41496131)
8. Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., and Schulenburg, S. (2003 a). Hyper-heuristics: An emerging direction in modern search technology. Handbook of metaheuristics, F. Glover, and, G. A. Kochenberger, eds., Kluwer, Dordrecht, Netherlands, 457-474.
9. Burke, E., Kendall, G., and Soubeiga, E. (2003 b). A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics, 9 (6), 451-470. 10.1023/B:HEUR.0000012446.94732.b6 1381-1231
10. Chakhlevitch, K., and Cowling, P. (2008). Hyperheuristics: Recent developments. Adaptive and multilevel metaheuristics, Studies in computational intelligence, C. Cotta, M. Sevaux, and, K. Sorensen, eds., Vol. 136, Springer, Berlin, 3-29.
11. Chan, W., Chua, D. K. H., and Kannan, G. (1996). Construction resource Scheduling with genetic algorithms. J. Constr. Eng. Manage., 122 (2), 125-132. 10.1061/(ASCE)0733-9364(1996)122:2(125) 0733-9364 (Pubitemid 126567089)
12. Christodoulou, S. (2010). Scheduling resource-constrained projects with ant colony optimization artificial agents. J. Comput. Civ. Eng., 24 (1), 45-55. 10.1061/(ASCE)0887-3801(2010)24:1(45) 0887-3801
13. Debels, D., De Reyck, B., Leus, R., and Vanhoucke, M. (2006). A hybrid scatter search/electromagnetism metaheuristic for project scheduling. Eur. J. Oper. Res., 169 (2), 638-653. 10.1016/j.ejor.2004.08.020 0377-2217 (Pubitemid 41375712)
14. Demeulemeester, E., and Herroelen, W. (1992). A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manage. Sci., 38 (12), 1803-1818. 10.1287/mnsc.38.12.1803 0025-1909
15. Demeulemeester, E. L., and Herroelen, W. S. (2002). Project scheduling-A research handbook, Kluwer, Boston.
16. Dorndorf, U., and Pesch, E. (1995). Evolution based learning in a job shop scheduling environment. Comput. Oper. Res., 22 (1), 25-40. 10.1016/0305-0548(93)E0016-M 0305-0548
17. Dowsland, K. A., Soubeiga, E., and Burke, E. (2007). A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. Eur. J. Oper. Res., 179 (3), 759-774. 10.1016/j.ejor.2005.03.058 0377-2217 (Pubitemid 46038588)
18. Feo, T. A., and Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. J. Global Optim., 6 (2), 109-133. 10.1007/BF01096763 0925-5001
19. Fleszar, K., and Hindi, K. (2004). Solving the resource-constrained project scheduling problem by a variable neighbourhood search. Eur. J. Oper. Res., 155 (2), 402-413. 10.1016/S0377-2217(02)00884-6 0377-2217
20. Gavish, B., and Pirkul, H. (1991). Algorithms for multi-resource generalized assignment problem. Manage. Sci., 37 (6), 695-713. 10.1287/mnsc.37.6.695 0025-1909
21. Han, L., and Kendall, G. (2003). An investigation of a tabu assisted hyper-heuristic genetic algorithm. Proc., 2003 IEEE Congress on Evolutionary Computation (CEC 2003), IEEE Computer Society Press, Canberra, Australia, 2230-2237.
22. Hart, E., and Ross, P. (1998). A heuristic combination method for solving job-shop scheduling problems. Parallel Problem Solving from Nature-PPSN V, Lecture Notes in Computer Science, A. E. Eiben, T. Back, M. Schoenauer, and, H. P. Schwefel, eds., vol. 1498, Springer, Heidelberg, 845-854. (Pubitemid 128146014)
23. Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling. Nav. Res. Logist. Q., 45 (7), 733-750. 10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C 0028-1441 (Pubitemid 128587349)
24. Hartmann, S., and Briskorn, D. (2009). A survey of variants and extensions of the resource constrained project scheduling problem. Eur. J. Oper. Res., 10.1016/j.ejor.2009.11.005, to be published. 0377-2217
25. Hegazy, T. (1999). Optimization of resource allocation and leveling using genetic algorithms. J. Constr. Eng. Manage., 125 (3), 167-175. 10.1061/(ASCE)0733-9364(1999)125:3(167) 0733-9364
26. Hegazy, T. (2002). Computer-based construction project management, Prentice-Hall, Upper Saddle River, NJ.
27. Jaskowsky, P., and Sobotka, A. (2006). Scheduling construction projects using evolutionary algorithm. J. Constr. Eng. Manage., 132 (8), 861-870. 10.1061/(ASCE)0733-9364(2006)132:8(861) 0733-9364 (Pubitemid 44090933)
28. Kandil, A., and El-Rayes, K. (2006). Parallel genetic algorithms for optimizing resource utilization in large-scale construction projects. J. Constr. Eng. Manage., 132 (5), 491-498. 10.1061/(ASCE)0733-9364(2006)132:5(491) 0733-9364
29. Kim, J. L., Ellis Jr., R. D. (2008). Permutation-based elitist genetic algorithm for optimization of large-sized resource-constrained project scheduling. J. Constr. Eng. Manage., 134 (11), 904-913. 10.1061/(ASCE)0733- 9364(2008)134:11(904) 0733-9364
30. Kolisch, R. (1996). Efficient priority rules for the resource-constrained project scheduling problem. J. Oper. Manage., 14 (3), 179-192. 10.1016/0272-6963(95)00032-1 (Pubitemid 126365433)
31. Kolisch, R., and Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. Eur. J. Oper. Res., 174 (1), 23-37. 10.1016/j.ejor.2005.01.065 0377-2217 (Pubitemid 44866841)
32. Lova, A., Tormos, P., Cervantes, M., and Barber, F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int. J. Prod. Econ., 117 (2), 302-316. 10.1016/j.ijpe.2008.11.002 0925-5273
33. Merkle, D., Middendorf, M., and Schmeck, H. (2002). Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput., 6 (4), 333-346. 10.1109/TEVC.2002.802450 0025-1909 (Pubitemid 35032735)
34. Mingozzi, A., Maniezzo, V., Ricciardelli, S., and Bianco, L. (1998). An exact algorithm for the resource constrained project scheduling problem based on a new mathematical formulation. Manage. Sci., 44 (5), 714-729. 10.1287/mnsc.44.5.714 0025-1909 (Pubitemid 128596875)
35. Nonobe, K., and Ibaraki, T. (2001). Formulation and tabu search algorithm for the resource constrained project scheduling problem. Essays and Surveys in Metaheuristics, C. C. Ribeiro, and, P. Hansen, eds., Kluwer Academic Publishers, Dordrecht, Netherlands, 557-588.
36. Ouelhadj, D., and Petrovic, S. (2010). A cooperative hyper-heuristic search framework. J. Heuristics, 16 (6), 835-857. 10.1007/s10732-009-9122-6 1381-1231
37. Pan, N. H., Hsaio, P. W., and Chen, K. Y. (2008). A study of project scheduling optimization using Tabu Search algorithm. Eng. Appl. Artif. Intell., 21 (7), 1101-1112. 10.1016/j.engappai.2007.11.006 0952-1976
38. Qu, R., and Burke, E. K. (2009). Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems. J. Oper. Res. Soc., 60 (9), 1273-1285. 10.1057/jors.2008.102
39. Resende, M. G. C., and Ribeiro, C. C. (2003). Greedy randomized adaptive procedures. Handbook of metaheuristics, F. Glover, and, G. A. Kochenberger, eds., Kluwer Academic Publishers, Dordrecht, Netherlands, 219-249.
40. Storer, R. H., Wu, S. D., and Vaccari, R. (1995). Problem and heuristic search space strategies for job shop scheduling. ORSA J. Comput., 7 (4), 453-467. 10.1287/ijoc.7.4.453 0899-1499
41. Tavares, L. V., Ferreira, J. A., and Coelho, J. S. (1999). Risk of delay of a project in terms of the morphology of its network. Eur. J. Oper. Res., 119 (2), 510-537. 10.1016/S0377-2217(99)00150-2 0377-2217 (Pubitemid 30518404)
42. Weglarz, J., Jozefowska, J., Mika, M., and Waligora, G. (2011). Project scheduling with finite or infinite number of activity processing modes-A survey. Eur. J. Oper. Res., 208 (3), 177-205. 10.1016/j.ejor.2010.03.037 0377-2217
43. Zhang, H., Li, H., and Tam, C. M. (2006). Permutation-based particle swarm optimization for resource-constrained project scheduling. J. Comput. Civ. Eng., 20 (2), 141-149. 10.1061/(ASCE)0887-3801(2006)20:2(141) 0887-3801 (Pubitemid 43260088)