Resource constrained project scheduling: A hybrid neural approach

International Series in Operations Research and Management Science

Volumn 92, Issue , 2006, Pages 297-318

  Colak, Selcuk ^a   Agarwal, Anurag ^a   Erenguc, Selcuk S ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Heuristics; Neural networks; Project management; Resource constrained project scheduling

Indexed keywords

EID: 84955240346     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (61)

1. Agarwal, A., Jacob, V.S. and Pirkul, H. (2003). Augmented neural networks for task scheduling, European Journal of Operational Research, 151(3):481-502.
2. Agarwal, A., Colak, S. and Eryarsoy, E. (2005). Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach, European Journal of Operational Research, 169(3):801-815.
3. Alcaraz, J. and Maroto, C. (2001). A robust genetic algorithm for resource allocation in Project Scheduling, Annals of Operations Research. 102:83-109.
4. Alcaraz, J., Maroto, C. and Ruiz, R. (2004). Improving the performance of genetic algorithms for the RCPS problem. Proceedings of the Ninth International Workshop on Project Management and Scheduling, pp. 40-43.
5. Alvares-Valdes, R. and Tamarit, J.M. (1989). Heuristic algorithms for resourceconstrained project scheduling: A review and an empirical analysis, in: Advances in Project Scheduling, R. Slowinski, J. Weglarz (Eds.), Elsevier, Amsterdam, pp. 113-134.
6. Baar, T., Brucker, P. and Knust, S. (1997). Tabu search algorithms for resourceconstrained project scheduling problems, in: Metaheuristics: Advances and Trends in Local Search Paradigms for Optimisation, S. Voss, S. Martello, I. Osman, C. Roucairol (Eds.), Kluwer, pp. 1-18.
7. Blazewicz, J., Lenstra, J.K. and Rinnooy Kan A.H.G. (1983). Scheduling projects to resource constraints: classification and complexity. Discrete Applied Mathematics. 5:11-24.
8. Boctor, F.F. (1990). Some efficient multi-heuristic procedures for resourceconstrained project scheduling, European Journal of Operational Research 49:3-13.
9. Boctor, F.F. (1996). An adaptation of the simulated annealing algorithm for solving resource-constrained project scheduling problems, International Journal of Production Research, 34:2335-2351.
10. Bouleimen, K. and Lecocq, H. (2003). A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version, European Journal of Operational Research, 149:268-281.
11. Brucker, P., Knust, S., Schoo, A. and Thiele, O. (1998). A branch & bound algorithm for the resource-constrained project scheduling problem, European Journal of Operational Research 107(2):272-288.
12. Brucker, P., Drexl, A., Mohring, R., Neumann, K. and Pesch, E. (1999). Resourceconstrained project scheduling: notation, classification, models, and methods, European Journal of Operational Research, 112(1):3-41.
13. Christofides, N., Alvarez-Valdes, R. and Tamarit, J.M. (1987). Project scheduling with resource constraints: a branch-and-bound approach, European Journal of Operational Research 29(2):262-273.
14. Cho, J.H. and Kim, Y.D. (1997). A simulated annealing algorithm for resourceconstrained project scheduling problems, Journal of the Operational Research Society, 48:736-744.
15. Coelho, J. and Tavares, L. (2003). Comparative analysis of meta-heuricstics for the resource constrained project scheduling problem. Technical report. Department of Civil Engineering, Instituto Superior Tecnico, Portugal.
16. Cooper, D.F. (1976). Heuristics for scheduling resource-constrained projects: An experimental investigation. Management Science 22:1186-1194.
17. Davis, E.W. and Heidom, G.E. (1971). An algorithm for optimal project scheduling under multiple resource constraints. Management Science 17:803-816.
18. Davis, E.W. and Patterson, J.H. (1975). A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science, 21:944-955.
19. Debels, D., De Reyck, B., Leus, R. and Vanhoucke, M. (2006). A hybrid scatter search/electromagnetism meta-heuristic for project scheduling, European Journal of Operational Research 169(2):638-653.
20. Demeulemeester, E. and Herroelen, W. (1992). A branch-and-bound procedure for the multiple resource-constrained project scheduling problems. Management Science, 38(12):1803-1818.
21. Demeulemeester, E. and Herroelen, W. (1997). New benchmark results for the resource-constrained project scheduling problem. Management Science 43(11): 1485-92.
22. Domdorf, U., Pesch, E. and Phan-Huy, T. (2000). A branch-and-bound algorithm for the resource-constrained project scheduling problem, Mathematical Methods of Operations Research, 52:413-439.
23. Drexl, A. (1991). Scheduling of project networks by job assignment, Management Science. 37:1590-1602.
24. Foo, Y.P.S. and Takefuji, Y. (1988). Stochastic neural networks for solving jobshop scheduling. Proceedings of Joint International Conference on Neural Networks Vol 2, pp. 275-290.
25. Hartmann, S. (1998). A competitive genetic algorithm for the resource-constrained project scheduling, Naval Research Logistics, 45:733-750.
26. Hartmann, S. (2002). A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Research Logistics. 49:433-448.
27. Hartmann, S. and Kolisch, R. (2000). Experimental evaluation of state-oftheart heuristics for the resource-constrained project scheduling problem, European Journal of Operational Research 127:394-407.
28. Herroelen, W., Demeulemeester, E. and De Reyck, B. (1998). Resource-constrained project scheduling: A survey of recent developments. Computers & Operations Research 25(4):279-302.
29. Hindi, K. S., Yang H. and Fleszar, K. (2002). An evolutionary algorithm for resource-constrained project scheduling, IEEE Transactions on Evolutionary Computation. 6:512-518.
30. Hopfield, J.J. and Tank, D.W. (1985). Neural computation of decisions in optimization problems. Biological Cybernetics. 52:141-152.
31. Icmeli, O., Erenguc, S.S. and Zappe, C.J. (1993). Project scheduling problems: A survey. International Journal of Operations & Production Management 13(11):80-91.
32. Kolisch, R. (1995). Project scheduling under resource constraints: efficient heuristics for several problem classes, Physica, Heidelberg, Germany.
33. Kolisch, R. (1996a). Efficient priority rule for the resource-constrained project scheduling problem. Journal of Operations Management. 14(3): 179-192.
34. Kolisch, R. (1996b). Serial and parallel resource-constrained project scheduling methods revisited: theory and computation, European Journal of Operational Research 90:320-333.
35. Kolisch, R. and Drexl, A. (1996). Adaptive search for solving hard project scheduling problems. Naval Research Logistics. 43:230.
36. Kolisch, R. and Hartmann, S. (2005). Experimental investigation of heuristics for resource-constrained project scheduling: An update, European Journal of Operational Research, forthcoming.
37. Kolisch, R. and Padman, R. (2001). An integrated survey of deterministic project scheduling, OMEGA. 29:249-272.
38. Kolisch R. and Sprecher, A. (1996). PSPLIB -A project scheduling problem library. European Journal of Operational Research, 96(1):205-216
39. Kolisch, R., Sprecher, A, and Drexl, A. (1995). Characterisation and generation of a general class of resource-constrained project scheduling problem, Management Science, 41(10): 1693-1703.
40. Lee, J.K. and Kim, Y.D., 1996, Search heuristics for resource-constrained project scheduling. Journal of the Operational Research Society, 47:678-689.
41. Leon, V.J. and Ramamoorthy, B. (1995). Strength and adaptability of problemspace based neighborhoods for resource-constrained scheduling, OR Spektrum, 17:173-182.
42. Mingozzi, A. , Maniezzo, V, Ricciardelli, S. and Bianco, L. (1998). An exact algorithm for project scheduling with resource constraints based on new mathematical formulation. Management Science, 44(5):714-29.
43. Merkle, D., Middendorf, M. and Schmeck H. (2002). Ant colony optimization for resource-constrained project scheduling, IEEE Transactions on Evolutionary Computation. 6:333-346.
44. Nonobe, K. and Ibaraki, T. (2002). Formulation and tabu search algorithm for the resource constrained project scheduling problem, in: Essays and Surveys in Metaheuristics, C. C. Ribeiro and R Hansen, eds, Kluwer Academic Publishers, pp. 557-588.
45. Ozdamar, L. and Ulusoy, G., (1994). A local constraint based analysis approach to project scheduling under general resource constraints, European Journal of Operational Research, 79:287-298.
46. Ozdamar, L. and Ulusoy, G. (1995). A survey on the resource-constrained project scheduling problem, HE Transactions. 27:574-586.
47. Patterson, J.H. and Huber, W.D. (1974). A horizon-varying, zero-one approach to project scheduling. Management Science 20:990-998.
48. Patterson, J.H. and Roth, G.W., 1976, Scheduling a project under multiple resource constraints: a zero-one programming approach, AIIE Transactions. 8:449-55.
49. th International Workshop on Project Management and Scheduling, Leuven, Belgium, pp. 102-106.
50. Pritsker, A.A.B., Watters, L.J. and Wolfe, P.M. (1969). Multiproject scheduling with limited resources: a zero-one programming approach. Management Science 16: 93-107.
51. Sabuncuoglu, I. and Gurgun, B. (1996). A neural network model for scheduling problems, European Journal of Operational Research 93:288-299.
52. Schirmer, A. and Riesenberg, S. (1998). Class-based control schemes for parameterized project scheduling heuristics, Manuskripte aus den Instituten fur Betriebswirtschaftslehre 471, Universitat Kiel, Germany.
53. Schirmer, A. (2000). Case-based reasoning and improved adaptive search for project scheduling, Naval Research Logistics.47:201-222.
54. Talbot, F.B, and Patterson, J.H. (1978). An efficient integer programming algorithm with network cuts for solving resource constrained scheduling problems, Management Science, 24(11): 1163-74.
55. Thomas, P. R. and Salhi, S. (1998). A tabu search approach for the resource constrained project scheduling problem. Journal of Heuristics, 4:123-139.
56. Toklu, Y.C. (2002). Application of genetic algorithms to construction scheduling with or without resource constraints, Canadian Journal of Civil Engineering. 29:421-429.
57. Tormos, P. and Lova, A,, 2001, A competitive heuristic solution technique for resource constrained project scheduling, Annals of Operations Research. 102:65-81.
58. Tormos, P. and Lova, A. (2003). An efficient multi-pass heuristic for project scheduling with constrained resources, International Journal of Production Research. 4l(5): l07l-l086.
59. Ulusoy, G. and Ozdamar, L. (1989). Heuristic performance and network/ resource characteristics in resource-constrained project scheduling. Journal of the Operational Research Society. 40:1145-1152.
60. Vails, v., Ballestin, F. and Quintanilla, M. S. (2003). A hybrid genetic algorithm for the RCPSP, Technical report, Department of Statistics and Operations Research, University of Valencia.
61. Vails, V, Ballestin, F. and Quintanilla M. S. (2005). Justification and RCPSP: A technique that pays, European Journal of Operational Research. 165(2): 375-386.