Genres - Extension of Brooks Algorithm for Project Scheduling with Resource Constraints
Abbreviated Journal Title
Comput. Ind. Eng.
Computer Science; Interdisciplinary Applications; Engineering; Industrial
In project scheduling by network analysis, traditional critical path methods fail to include resource considerations. Other methods must be used to allow for resource considerations. This article explores one area of resource considerations: project scheduling under resource constraints. The specific case investigated is the single resource, single project schedule. A model, entitled the GENRES search model, is developed. The model utilizes Brooks Algorithm (BAG) to generate the project schedule. The criteria used are various weighted combinations of ACTIM and ACTRES (Bedworth, Industrial Systems). The best project schedule is that which gives the least project duration.
The GENRES model was found effective in finding project durations equal to or less than that of ACTIM, ACTRES or TIMRES (the combination of ACTIM and ACTRES with each given equal weight). The research also found that when the project completion time found by the algorithm approaches the critical path duration, resource leveling may be preferred.
Computers & Industrial Engineering
Pergamon-Elsevier Science Ltd
Whitehouse, G. E., Brown, J. R. (1979). Genres - Extension of Brooks Algorithm for Project Scheduling with Resource Constraints. Computers & Industrial Engineering, 3(3), 261-268. http://dx.doi.org/10.1016/0360-8352(79)90020-2