Resource-constrained project scheduling: A survey of recent developments

Computers and Operations Research

Volumn 25, Issue 4, 1998, Pages 279-302

  Herroelen, Willy ^a   De Reyck, Bert ^a   Demeulemeester, Erik ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; CRITICAL PATH ANALYSIS; DECISION THEORY; PERT; RESOURCE ALLOCATION;

RESOURCE-CONSTRAINED PROJECT SCHEDULING; TRUNCATED BRANCH-AND-BOUND METHODS;

SCHEDULING;

EID: 0032042933     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00055-5     Document Type: Article

References (118)

1. Muth, J. F. and Thompson, G. L., Industrial Scheduling. Prentice Hall, Englewood Cliffs, N.J., 1963.
2. Conway, R. W., Maxwell, W. L. and Miller L. W., Theory of Scheduling. Addison-Wesley Publishing Company, 1967.
3. Ashour, S., Sequencing Theory. Springer-Verlag, Berlin, 1972.
4. Baker, K. R., Introduction to Sequencing and Scheduling. John Wiley, New York, 1974.
5. Rinnooy Kan, A. H. G., Machine Scheduling Problems - Classification, Complexity and Computations. M. Nijhoff, The Netherlands, 1976.
6. French, S., Sequencing and Scheduling - An Introduction to the Mathematics of the Job Shop. John Wiley, New York, 1982.
7. Bellmann, R., Esogbue, A. O. and Nabeshima, I., Mathematical Aspects of Scheduling and Applications. Pergamon Press, Oxford, U.K., 1982.
8. Herroelen, W., Operationele Produktieplanning. Acco, Leuven, 1991.
9. Blazewicz, J., Ecker, K., Schmidt, G. and Weglarz, J., Scheduling in Computer and Manufacturing Systems. Springer-Verlag, Berlin, 1993.
10. Morton, Th. E. and Pentico, D. W., Heuristic Scheduling Systems - With Applications to Production Systems and Project Management. Wiley Interscience, New York, 1993.
11. Tanaev, V. S., Gordon, V. S. and Shafransky, Y. M., Scheduling Theory: Single-Stage Systems. Kluwer Academic Publishers, Dordrecht, 1994.
12. Tanaev, V. S., Sotskov, Y. N. and Strusevich, V. A., Scheduling Theory: Multi-Stage Systems. Kluwer Academic Publishers, Dordrecht, 1994.
13. Brucker, P., Scheduling Algorithms. Springer-Verlag, Berlin, 1995.
14. Pinedo, M., Scheduling - Theory, Algorithms and Systems. Prentice-Hall, Englewood Cliffs, New Jersey, 1995.
15. Gargeya, V. B. and Deane, R. H., Scheduling research in multiple resource constrained job shops: A review and critique. International Journal of Production Research, 1996, 34, 2077-2097.
16. Blazewicz, J., Lenstra, J. K. and Rinnooy Kan, A. H. G., Scheduling projects to resource constraints: Classification and complexity. Discrete Applied Mathematics, 1983, 5, 11-24.
17. Bowman, E. H., The schedule-sequencing problem. Operations Research, 1959, 7, 621-624.
18. Brand, J. D., Meyer, W. L. and Shaffer, L. R., The resource scheduling problem in construction, Civil Engineering Studies, Report 5, Department of Civil Engineering, University of Illinois, Urbana, 1964.
19. Wiest, J. D., Some properties of schedules for large projects with limited resources. Operations Research, 1964, 12, 395-418.
20. Moodie, C. L. and Mandeville, D. E., Project resource balancing by assembly line balancing techniques. Journal of Industrial Engineering, 1966, 17, 377-383.
21. Elmaghraby, S. E., The sequencing of n jobs on m parallel processors. Unpublished paper, North Carolina State University at Raleigh, Raleigh, U.S.A., 1967.
22. Pritsker, A. B., Watters, L. J. and Wolfe, P. M., Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 1969, 16, 93-108.
23. Patterson, J. H. and Huber, W. D., A horizon-varying zero-one approach to project scheduling. Management Science, 1974, 20, 990-998.
24. Patterson, J. H. and Roth, G., Scheduling a project under multiple resource constraints: A zero-one programming approach. AIIE Transactions, 1976, 8, 449-456.
25. Deckro, R. F., Winkofsky, E. P., Hebert, J. E. and Gagnon, R., A decomposition approach to multi-project scheduling. European Journal of Operational Research, 1991, 51, 110-118.
26. Icmeli, O. and Rom, W. O., Solving the resource-constrained project scheduling problem with optimization subroutine library. Computers and Operations Research, 1996, 23, 801-817.
27. Carruthers, J. A. and Battersby, A., Advances in critical path methods. Operational Research Quarterly, 1966, 17, 359-380.
28. Petroviç, R., Optimisation of resource allocation in project planning. Operations Research, 1968, 16, 559-586.
29. Johnson, T. J. R., An algorithm for the resource constrained project scheduling problem, Ph.D. Dissertation, MIT, 1967
30. Balas, E., Project Scheduling with Resource Constraints. In Applications of Mathematical Programming, ed E. M. L. Beale. The English University Press, London, 1971, pp. 187-200.
31. Schrage, L., Solving resource-constrained network problems by implicit enumeration - Nonpreemptive case. Operations Research, 1970, 10, 263-278.
32. Davis, E. W. and Heidorn, G. E., An algorithm for optimal project scheduling under multiple resource constraints. Management Science, 1971, 27, B803-B816.
33. Stinson, J. P., Davis, E. W. and Khumawala, B. M., Multiple resource-constrained scheduling using branch-and-bound. AIIE Transactions, 1978, 10, 252-259.
34. Talbot, B. and Patterson, J. H., An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Management Science, 1978, 24, 1163-1174.
35. Radermacher, F. J., Scheduling of project networks. Annals of Operations Research, 1985, 4, 227-252.
36. Christofides, N., Alvarez-Valdes, R. and Tamarit, J. M., Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research, 1987, 29, 262-273.
37. Bartusch, M., Möhring, R. H. and Radermacher, F. J., Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 1988, 16, 201-240.
38. Bell, C. A. and Park, K., Solving resource-constrained project scheduling problems by A* search. Naval Research Logistics, 1990, 37, 61-84.
39. Carlier, J. and Latapie, B., Une méthode arborescente pour les problèmes cumulatifs. R.A.I.R.O., 1991, 25, 311-340.
40. Demeulemeester, E. and Herroelen, W., A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science, 1992, 38, 1803-1818.
41. Demeulemeester, E. and Herroelen, W., New benchmark results for the resource-constrained project scheduling problem. Management Science, 1997, 43, 1485-1492.
42. Carlier, J. and Neron, E., A new branch and bound method for solving the resource constrained project scheduling problem. Proceedings of the Fifth International Workshop on Project Management and Scheduling, Poznan, April 11-13, 1996, pp. 61-65.
43. Mingozzi, A., Maniezzo, V., Ricciardelli, S. and Bianco, L., An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science, 1998, to appear.
44. Brucker, P., Schoo, A. and Thiele, O., A branch-and-bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 1998, to appear.
45. Davis, E. W., Resource allocation in project network models - A survey. Journal of Industrial Engineering, 1966, 17, 177-188.
46. Davis, E. W., Project scheduling under resource constraints: Historical review and categorization of procedures. AIlE Transactions, 1973, 5, 297-313.
47. Herroelen, W., Resource-constrained project scheduling - The state of the art. Operational Research Quarterly, 1972, 23, 261-275.
48. Patterson, J. H., A comparison of exact procedures for solving the multiple constrained resource project scheduling problem. Management Science, 1984, 30, 854-867.
49. Icmeli, O., Erengüç, S. S. and Zappe, J. C., Project scheduling problems: A survey. International Journal of Production and Operations Management, 1993, 13, 80-91.
50. Elmaghraby, S. E., Activity nets: A guided tour through some recent developments. European Journal of Operational Research, 1995, 82, 383-408.
51. Herroelen, W. and Demeulemeester, E., Recent advances in branch-and-bound procedures for resource-constrained project scheduling problems. In Scheduling Theory and Its Applications, eds Ph. Chrétienne, E. G. Coffmann Jr., J. K. Lenstra and Z. Liu. John Wiley and Sons, 1995, pp. 259-276.
52. Özdamar, L. and Ulusoy, G., A Survey on the resource-constrained project scheduling problem. IIE Transactions, 1995, 27, 574-586.
53. Kolisch, R., Sprecher, A. and Drexl, A., Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 1995, 41, 1693-1703.
54. Demeulemeester, E., Herroelen, W., Simpson, W. P., Baroum, S., Patterson, J. H. and Yang, K.-K., On a paper by Christofides et al. for solving the multiple-resource constrained single project scheduling problem. European Journal of Operational Research, 1994, 76, 218-228.
55. Sprecher, A. and Drexl, A., Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. European Journal of Operational Research, 1998, to appear.
56. Kolisch, R. and Sprecher, A., PSPLIB - A project scheduling problem library. European Journal of Operational Research, 1997, 96, 205-216.
57. De Reyck, B. and Herroelen, W., On the use of the complexity index as a measure of complexity in activity networks, European Journal of Operational Research, 1996, 91, 347-366.
58. Pascoe, T. L., Allocation of resources - CPM. Revue Française de Recherche Opérationelle, 1966, 38, 31-38,
59. Davis, E. W., Project network summary measures and constrained resource scheduling. IIE Transactions, 1975, 7, 132-142.
60. Talbot, F. B., Resource-constrained project scheduling with time-resource trade-offs: The nonpreemptive case. Management Science, 1982, 28, 1197-1210.
61. Kurtulus, I. S. and Narula, S. C., Multi-project scheduling: Analysis of project performance. IIE Transactions, 1985, 17, 58-66.
62. Alvarez-Valdes, R. and Tamarit, J. M. Heuristic algorithms for resource-constrained project scheduling: A review and empirical analysis. In Advances in Project Scheduling, ed R. Slowinski and J. Weglarz. Elsevier, Amsterdam, 1989.
63. Elmaghraby, S. E. and Herroelen, W., On the measurement of complexity in activity networks. European Journal of Operational Research, 1980, 5, 223-234.
64. Bein, W. W., Kamburowski, J. and Stallmann, M. F. M., Optimal reduction of two-terminal directed acyclic graphs. SIAM Journal on Computing, 1992, 21, 1112-1129.
65. De Reyck, B., On the use of the restrictiveness as a measure of complexity for resource-constrained project scheduling, Research Report 9535, Department of Applied Economics, K.U. Leuven., 1995.
66. De Reyck, B. and Herroelen, W., Assembly line balancing by resource-constrained project scheduling techniques - A critical appraisal. Foundations of Computing and Decision Sciences, 1997, 99, 143-167.
67. Mastor, A. A., An experimental and comparative evaluation of production line balancing techniques. Management Science, 1970, 16, 728-746.
68. Kao, E. P. C. and Queyranne, M., On dynamic programming methods for assembly line balancing. Operations Research, 1992, 30, 375-390.
69. Dar-El, E. M., MALB - A heuristic technique for balancing large single-model assembly lines, AIIE Transactions, 1973, 5, 343-356.
70. Cooper, D. F., Heuristics for scheduling resource-constrained projects: An experimental comparison. Management Science, 1976, 22, 1186-1194.
71. Patterson, J. H., Project scheduling: The effects of problem structure on heuristic performance. Naval Research Logistics, 1976, 23, 95-123.
72. Demeulemeester, E., Optimal algorithms for various classes of multiple resource-constrained project scheduling problems. Ph.D. Thesis, Department of Applied Economic Sciences, Katholieke Universiteit Leuven, 1992.
73. Slowinski, R., Two approaches to problems of resource allocation among project activities - A comparative study. Journal of the Operational Research Society, 1980, 31, 711-723.
74. Weglarz, J., Project scheduling with continuously-divisible doubly-constrained resources. Management Science, 1981, 27, 1040-1053.
75. Kaplan, L., Resource-constrained project scheduling with preemption of jobs. Ph.D. Dissertation, University of Michigan, 1988.
76. Kaplan, L., Resource-constrained project scheduling with setup times, Unpublished paper, Department of Management, University of Tenessee, Knoxville, 1991.
77. Demeulemeester, E. and Herroelen, W., An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. European Journal of Operational Research, 1996, 90, 334-348.
78. Simpson III, W. P. and Patterson, J. H., A multiple-tree search procedure for the resource-constrained project scheduling problem. European Journal of Operational Research, 1996, 89, 525-542.
79. Kerbosch, J. A. G. M. and Schell, H. J., Network planning by the extended METRA potential method, Report KS-1.1, University of Technology Eindhoven, Department of Industrial Engineering, 1975.
80. Zahn, J., Heuristics for scheduling resource-constrained projects in MPM networks. European Journal of Operational Research, 1994, 76, 192-205.
81. Moder, J. J., Phillips, C. R. and Davis, E. W., Project Management with CPM, PERT and Precedence Diagramming. Van Nostrand Reinhold, 1983.
82. Brinkmann, K. and Neumann, K., Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: The minimum project duration and resource levelling problem, Technical Report WIOR-443, Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, 1994.
83. Neumann, K. and Zahn, J., Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints. Journal of Intelligent Manufacturing, 1995, 6, 145-154.
84. Neumann, K. and Schwindt, C., Projects with minimal and maximal time lags: Construction of activity-on-node networks and applications, Technical Report WIOR-447, Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, 1995.
85. Schwindt, C., Generation of resource-constrained project scheduling problems with minimal and maximal time lags, Technical Report WIOR-489, Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, 1996.
86. Franck, B. and Neumann, K., Priority-rule methods for the resource-constrained project scheduling problem with minimal and maximal time lags - An empirical analysis. Proceedings of the Fifth International Workshop on Project Management and Scheduling, April 11-13, Poznan, 1996, pp. 88-91.
87. Schwindt, C. and Neumann, K., A new branch-and-bound-based heuristic for resource-constrained project scheduling with minimal and maximal time lags. Proceedings of the Fifth International Workshop on Project Management and Scheduling, April 11-13, Poznan, pp. 212-215, 1996.
88. Wikum, E. D., Donna, C. L. and Nemhauser, G. L., One-machine generalized precedence constrained scheduling problems. Operations Research Letters, 1994, 16, 87-99.
89. Elmaghraby, S. E. and Kamburowski, J., The analysis of activity networks under generalized precedence relations. Management Science, 1992, 38, 1245-1263.
90. Demeulemeester, E. and Herroelen, W., A branch-and-bound procedure for the generalized resource-constrained project scheduling problem. Operations Research, 1997, 45, 201-212.
91. Möhring, R. H., Private communication, 1996.
92. De Reyck, B. and Herroelen, W., A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence constraints. European Journal of Operational Research, 1997, to appear.
93. Herroelen, W., Van Dommelen, P. and Demeulemeester, E., Project network models with discounted cash flows - A guided tour through recent developments. European Journal of Operational Research, 1997, 100, 97-121.
94. Russell, A. H., Cash flows in networks, Management Science, 1970, 16, 357-373.
95. Grinold, R. C., The payment scheduling problem. Naval Research Logistics Quarterly, 1972, 19, 123-136.
96. Elmaghraby, S. E. and Herroelen, W., The scheduling of activities to maximize the net present value of projects, European Journal of Operational Research, 1990, 49, 35-49.
97. Herroelen, W. and Gallens, E., Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects. European Journal of Operational Research, 1993, 65, 274-277.
98. Demeulemeester, E., Herroelen, W. and Van Dommelen, P., An optimal recursive search procedure for the deterministic unconstrained MAX-NPV scheduling problem, Research Report 9603, Department of Applied Economics, K.U. Leuven, 1996.
99. De Reyck, B. and Herroelen, W., An optimal procedure for the unconstrained MAX-NPV project scheduling problem with generalized precedence relations, Research Report 9642, Department of Applied Economics, K.U. Leuven, 1996.
100. Baroum, S. M., An exact solution procedure for maximizing the net present value of resource-constrained projects. Unpublished Ph.D. Dissertation, Indiana University, 1992.
101. Icmeli, O. and Erenguç, S., A branch-and-bound procedure for the resource-constrained project scheduling problem with discounted cash flows. Management Science, 1996, 42, 1395-1408.
102. Yang, K. K., Talbot, F. B. and Patterson, J. H., Scheduling a project to maximize its net present value: An integer programming approach. European Journal of Operational Research, 1992, 64, 188-198.
103. De Reyck, B. and Herroelen, W., An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Computers and Operations Research, 1998, 25, 1-17.
104. Herroelen, W., Een probleem van "resource allocation": Het toewijzen van netwerkactiviteiten aan ingenieurs. Comm. Eng. Thesis, Department of Applied Economics, K.U. Leuven, 1968.
105. Elmaghraby, S. E., Activity Networks: Project Planning and Control by Network Models. John Wiley and Sons, New York, 1977.
106. Demeulemeester, E., De Reyck, B. and Herroelen, W., The discrete time/resource trade-off problem in project networks - A branch-and-bound approach, Research Report 9717, Department of Applied Economics, K.U. Leuven, 1997.
107. De Reyck, B., Demeulemeester, E. and Herroelen, W., Local search methods for the discrete time/resource trade-off problem in project networks, Research Report 9710, Department of Applied Economics, K.U. Leuven, 1997.
108. Sprecher, A., Hartmann, S. and Drexl, A., An exact algorithm for project scheduling with multiple modes. OR Spektrum, 1997, 19, 195-203.
109. Speranza, M. G. and Vercellis, C., Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, 1993, 64, 312-325.
110. Sprecher, A., Resource-constrained project scheduling: Exact methods for the multi-mode case. In Lecture Notes in Economics and Mathematical Systems, Vol. 409, Springer-Verlag, Berlin, 1994.
111. Hartmann, S. and Sprecher, A., A note on "Hierarchical models for multi-project planning and scheduling". European Journal of Operational Research, 1996, 94, 377-383.
112. Patterson, J. H., Slowinski, R., Talbot, F. B. and Weglarz, J., An algorithm for a general class of precedence and resource constrained scheduling problems. In Advances in Project Scheduling, ed R. Slowinski and J. Weglarz. Elsevier, Amsterdam, 1989.
113. Patterson, J. H., Slowinski, R., Talbot, F. B. and Weglarz, J., Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems. European Journal of Operational Research, 1990, 49, 68-79.
114. Böttcher, J., Drexl, A. and Kolisch, R., A branch-and-bound procedure for project scheduling with partially renewable resource constraints. Proceedings of the Fifth International Workshop on Project Management and Scheduling, Poznan, April 11-13, 1996, pp. 48-51.
115. Drexl, A., Local search methods for project scheduling under partially renewable resource constraints. INFORMS San Diego Meeting, May 4-7, 1997.
116. Schirmer, A. and Drexl, A., Partially renewable resources - A generalization of resource-constrained project scheduling. IFORS 14th Triennal Conference, Vancouver, B.C., July 8-12, 1996.
117. Salewski, F. and Lieberam-Schmidt, S., Greedy look ahead methods for project scheduling under resource and mode identity constraints. Proceedings of the Fifth International Workshop on Project Management and Scheduling, Poznan, April 11-13, 1996, pp. 207-211.
118. Salewski, F., Tabu search algorithms for project scheduling under resource and mode identity constraints. IFORS 14th Triennal Conference, Vancouver, B.C., July 8-12, 1996.