Least impact algorithm for resource allocation
A new heuristic-based resource-scheduling algorithm called the least impact model is developed. Unlike available heuristic models, the least impact model allocates resources to a set or a group of activities simultaneously rather than sequentially to individual activities, so as to minimize the negative impact on the remaining total float calculated from a project CPM-type network. A new parameter called future float is introduced as an indicator for assigning scheduling priorities to the sets of activities being considered. Activity sets are generated by first considering all possible combinations of current activities experiencing resource conflict and then narrowing them down to those feasible, which in turn are assigned priorities for allocation of resources based on the least negative impact on the duration of the project. Two examples are worked out to illustrate the use and capabilities of the present model. The results indicate that the least impact model is capable of producing better solutions than those generated from the commonly used total float and the recently proposed current float techniques. Key words: planning and scheduling, resource allocation, resource-constraints scheduling, heuristic scheduling.