The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

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

Résumé

We define the resource-constrained activity insertion problem with minimum and maximum time lags. The problem aims at 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. We show that finding a feasible insertion position that minimizes the project duration is NP-hard in the general case. 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.pdf (624.15 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

  • HAL Id : hal-00194384 , version 1

Citer

Christian Artigues, Cyril Briand. The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags. 2007. ⟨hal-00194384v1⟩

Collections

LAAS-ROC
127 Consultations
220 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More