Overlapping Modes

Precedence relations are defined by an acyclic direct graph G(N, I ). Schedule π called feasible if for any moment of time resource limits c i are not violated and all jobs

Note that besides being a valid relaxation of the RCPSP, the problem (P ∆ ) can be used in a project planning context, when resource consumption have to be aggregated over sev-

We consider a project scheduling problem in a context such that temporal aspects (start and completion of activities, precedence between activities) are handled precisely,

We have discussed the well known pulse (PDDT) and step (SDDT) time-indexed formulations and the less well-known on/off time-indexed formulation (OODDT) for the RCPSP, that are

We observe that, in terms of number of (not necessarily optimal) integer solutions found, the OOE model or its variant OOE Prec outperform the other formulations on instance sets

The contributions of this article are threefold: (1) we describe how robust optimiza- tion can be applied to project scheduling under uncertainty; (2) we develop a scenario-

The objective (16) is to minimize the project duration, assigning a unique start date to each activity [constraints (17)], under both precedence constraints (18) and

In order to model the software pipelining problem, [DAA08] proposes an extension of the clas- sic modulo scheduling problem to Resource-Constrained Modulo Schedul- ing Problems