An efficient method for scheduling construction projects with resource constraints
By: ABEYASHINGHE, M. Chelaka L
.
Contributor(s): GREENWOOD, David J | JOHANSEN, D. Eric.
Material type: 
ArticlePublisher: 2001International Journal of Project Management 19, 1, p. 29-45Abstract: In construction scheduling, conflicts can arise when activities require common resources that are availabel only in limited quantities. To overcome this, while retaining minimum project durations, mathematical techniques have been developed for allocating resources. However, these produce a "hard" inflexible approach to resource-constrained schedules. The authors propose an efficient resource allocation algorithm (LINRES) which offers a more flexible approach. To study its performance, an experiment was contucted on 10 small network examples (6 to 29 activities) and the results were compared with those generated by a total of 32 existing heuristic rules. The results shows that the LINRES algorithm outperformed most other heuristic rules, including the widely used MINSLK rule in both single - and multi-resource networks. It also provides a reasonable trade-off between the resource-aggregation profiles and the durations
| Item type | Current location | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
| Periódico | Biblioteca Graciliano Ramos | Periódico | Not for loan |
In construction scheduling, conflicts can arise when activities require common resources that are availabel only in limited quantities. To overcome this, while retaining minimum project durations, mathematical techniques have been developed for allocating resources. However, these produce a "hard" inflexible approach to resource-constrained schedules. The authors propose an efficient resource allocation algorithm (LINRES) which offers a more flexible approach. To study its performance, an experiment was contucted on 10 small network examples (6 to 29 activities) and the results were compared with those generated by a total of 32 existing heuristic rules. The results shows that the LINRES algorithm outperformed most other heuristic rules, including the widely used MINSLK rule in both single - and multi-resource networks. It also provides a reasonable trade-off between the resource-aggregation profiles and the durations
Click on an image to view it in the image viewer
There are no comments for this item.