Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm

Abstract

AbstractIn some production processes, the effort associated with a certain activity for its execution can vary over time. In this case, the amount of work per time unit devoted to each activity, so as its duration, is not univocally determined. This kind of problem can be represented by an activity project network with the so-called feeding precedence relations, and activity variable execution intensity. In this paper, we propose a forward recursion algorithm able to find the earliest start and finish times of each activity, in $$O(m \log n)$$ O ( m log n ) time, with n and m being the number of activities and the number of precedence relations, respectively. In particular, this requires the calculation of the (optimal) execution intensity profile, for each activity, that warrants the earliest start schedule and the minimum completion time of the project.