Resource-constrained project scheduling with concave processing rate functions

In this paper, we address a resource‐constrained project scheduling problem involving a single resource. The resource can be applied at varying consumption rates to the activities of the project. The duration of each activity is defined by a convex, non‐increasing time‐resource trade‐off function. In addition, activities are not preemptable (ie, the resource consumption rate of an activity cannot be altered while the activity is being processed). We explicitly consider variation of the rate at which an activity is performed with variation in resource consumption rate. We designate the number of units (amount of an activity) performed per unit time with variation in resource consumption rate as the processing rate function, and assume this function to be concave. We present a tree‐search‐based method in concert with the solution of a nonlinear program and the use of dominance properties to determine: (i) the sequence in which to perform the activities of the project, and (ii) the resource consumption rate to allocate to each activity so as to minimize the project duration (makespan). We also present results of an experimental investigation that reveal the efficacy of the proposed methodology. Finally, we present an application of this methodology to a practical setting.