Title

Genres - Extension of Brooks Algorithm for Project Scheduling with Resource Constraints

Authors

Whitehouse, G. E.; Brown, J. R.

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Comput. Ind. Eng.

Keywords

Computer Science; Interdisciplinary Applications; Engineering; Industrial

Abstract

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.

Journal Title

Computers & Industrial Engineering

Volume

3

Issue/Number

3

Publication Date

1-1-1979

Document Type

Article

Language

English

Publisher

Pergamon-Elsevier Science Ltd

First Page

261

Last Page

268

WOS Identifier

WOS:A1979HZ06200007

ISSN

0360-8352

Share

COinS