Periodically Aggregated Resource-Constrained Project Scheduling Problem - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Article Dans Une Revue European Journal of Industrial Engineering Année : 2017

Periodically Aggregated Resource-Constrained Project Scheduling Problem

Résumé

In this paper, a new project scheduling problem is introduced, the periodically aggregated resource-constrained project scheduling problem (PARCPSP), in which the resource usage is considered on average over aggregated periods of parameterised length, while temporal aspects (start/completion dates of activities and precedence relations) are taken into account in an exact manner. A mixed integer linear programming formulation based on a mixed time representation is given. The adaptation of schedule generation schemes developed for standard project scheduling problems is discussed. An iterative solution scheme is described; experiments show that this method permits to find better upper bounds and sometimes enables to reduce the overall computational time.
Fichier principal
Vignette du fichier
Morin_19496.pdf (370.68 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01876198 , version 1 (26-06-2019)

Identifiants

Citer

Pierre-Antoine Morin, Christian Artigues, Alain Haït. Periodically Aggregated Resource-Constrained Project Scheduling Problem. European Journal of Industrial Engineering, 2017, 11 (6), 26p. ⟨10.1504/EJIE.2017.10009144⟩. ⟨hal-01876198⟩
23 Consultations
25 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More