The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2009

The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags

Christian Artigues
Cyril Briand

Résumé

This paper considers the resource-constrained activity insertion problem with minimum and maximum time lags. The problem consists in inserting a single activity in a partial schedule while preserving its structure represented through resource flow networks and minimizing the makespan increase caused by the insertion. In the general case, we show that finding a feasible insertion that minimizes the project duration is NP-hard. When only minimum time lags are considered and when activity durations are strictly positive, we show the problem is polynomially solvable, generalizing previously established results on activity insertion for the standard resource-constrained project scheduling problem.
Fichier principal
Vignette du fichier
RCAIP_Max_ArtiguesBriand-v2.pdf (243.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00194384 , version 1 (06-12-2007)
hal-00194384 , version 2 (01-09-2008)

Identifiants

Citer

Christian Artigues, Cyril Briand. The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags. Journal of Scheduling, 2009, 12, pp.447-460. ⟨10.1007/s10951-009-0124-x⟩. ⟨hal-00194384v2⟩
122 Consultations
199 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More