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...

Inventory constraints refer to so-called cumulative resources, which can store a single or several different products and have a prescribed minimum and maximum inventory, where the inventory is depleted and replenished over time. Some additional applications of cumulative resources, e.g. to...

In this paper we deal with the time complexity of single- and identical parallel-machine scheduling problems in which the durations and precedence constraints of the activities are stochastic. The stochastic precedence constraints are given by GERT networks. First, we sketch the basic concepts...