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

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

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

The concept of partially renewable resources provides a general modeling framework that can be used for a wide range of different real-life applications. In this paper, we consider a resource-constrained project duration problem with partially renewable resources, where the temporal constraints...

In this paper, we consider the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. For the first time, the concept of partially renewable resources is embedded in the context of projects with general temporal constraints. While...