Computing Redundant Resources for the RCPSP - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2007

Computing Redundant Resources for the RCPSP

Résumé

Several efficient lower bounds for the Resource Constrained Project Scheduling Problem (RCPSP) have been proposed recently. Some of them are based on the notion of redundant resource. In this paper we define a redundant function as an application f: [0, B] [0, B'] such that i 1 + i 2 + ...+i k B implies f(i 1 ) + f(i 2 ) +...+ f(i k ) B'. Then we explain that redundant functions are very useful for computing redundant resources. We also describe an algorithm for computing all maximal redundant functions. Computational results are reported.

Dates et versions

hal-01022110 , version 1 (10-07-2014)

Identifiants

Citer

Jacques Carlier, Emmanuel Neron. Computing Redundant Resources for the RCPSP. European Journal of Operational Research, 2007, 176, pp.1452-1463. ⟨10.1016/j.ejor.2005.09.034⟩. ⟨hal-01022110⟩
98 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More