We study the scheduling of projects subject to general temporal constraints between activities such that the project net present value is maximized. The proposed algorithm is based on a first-order steepest ascent approach, where the steepest ascent directions are normalized by the supremum...

We study the scheduling of projects subject to general temporal constraints between activities such that the project net present value is maximized. The proposed algorithm is based on a first-order steepest ascent approach, where the steepest ascent directions are normalized by the supremum...

The paper proposes a new classification of schedules for resource-constrained project scheduling problems with minimum and maximum time lags between project activities and regular and different types of nonregular objective functions. The feasible region of the scheduling problems represents a...