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

Christian Artigues 1 Cyril Briand 1
1 LAAS-MOGISA
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
Abstract : 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.
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2009, 12, pp.447-460. 〈10.1007/s10951-009-0124-x〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00194384
Contributeur : Christian Artigues <>
Soumis le : lundi 1 septembre 2008 - 18:00:47
Dernière modification le : mardi 10 octobre 2017 - 09:52:03
Document(s) archivé(s) le : mardi 21 septembre 2010 - 16:56:19

Fichier

RCAIP_Max_ArtiguesBriand-v2.pd...
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Christian Artigues, Cyril Briand. The Resource-Constrained Activity Insertion Problem with Minimum and Maximum Time Lags. Journal of Scheduling, Springer Verlag, 2009, 12, pp.447-460. 〈10.1007/s10951-009-0124-x〉. 〈hal-00194384v2〉

Partager

Métriques

Consultations de la notice

137

Téléchargements de fichiers

57