A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling

The problem addressed is that of scheduling the activities of a project network to minimize project duration under conditions of multiple limited resource requirements and availabilities. Various heuristic sequencing rules have been applied to this problem, and the effectiveness of these rules relative to one another has been previously compared in the literature. However, there have been no previous comparisons of the effectiveness of these rules relative to an optimum solution. This paper makes such a comparison of eight different heuristic scheduling rules, including those found most effective in previous research on this problem. Results are presented for a total of eighty-three different multi-resource problems.

• 저널Management Science · 21(8) · 944–955
• 토픽Resource-Constrained Project Scheduling · Management Science and Operations Research
• DOI10.1287/mnsc.21.8.944
• 저자Edward W. Davis, J. Herbert Patterson