Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Critical Path Resource Scheduling Algorithm
Most early applications of the critical path method did not consider the resources required to complete each project activity. Recently, increased attention has been given to this problem, and several methods have been suggested for scheduling activities which compete for resources which are available in stated maximum amounts. An algorithm is presented for scheduling project activities in such a way that the activities are performed in proper sequence, the total resource availabilities are not exceeded, and the project duration is kept to a minimum. The method assumes that activity durations can vary depending upon the amounts of resources assigned to them. A numerical example, using a small, hypothetical project network, is given. Further computational experience with a network of several hundred activities is reported. A possible extension of the approach, to provide for evaluating the cost of any premium time labor used to reduce project duration, is suggested. It is concluded that approaches of the type given herein are valid and worthy of further investigation.
Critical Path Resource Scheduling Algorithm
Most early applications of the critical path method did not consider the resources required to complete each project activity. Recently, increased attention has been given to this problem, and several methods have been suggested for scheduling activities which compete for resources which are available in stated maximum amounts. An algorithm is presented for scheduling project activities in such a way that the activities are performed in proper sequence, the total resource availabilities are not exceeded, and the project duration is kept to a minimum. The method assumes that activity durations can vary depending upon the amounts of resources assigned to them. A numerical example, using a small, hypothetical project network, is given. Further computational experience with a network of several hundred activities is reported. A possible extension of the approach, to provide for evaluating the cost of any premium time labor used to reduce project duration, is suggested. It is concluded that approaches of the type given herein are valid and worthy of further investigation.
Critical Path Resource Scheduling Algorithm
Bennett, F. Lawrence (Autor:in)
Journal of the Construction Division ; 94 ; 161-180
01.01.2021
201968-01-01 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Critical Path Scheduling under Resource Calendar Constraints
| Online Contents | 2008
Critical Path Scheduling under Resource Calendar Constraints
| British Library Online Contents | 2008
Resource-Constrained Critical Path Scheduling by a GRASP-Based Hyperheuristic
| British Library Online Contents | 2012
Resource-Constrained Critical Path Scheduling by a GRASP-Based Hyperheuristic
| Online Contents | 2012
Critical Path Segments Scheduling Technique
| Online Contents | 2010