A note on time-indexed formulations for the resource-constrained project scheduling problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

A note on time-indexed formulations for the resource-constrained project scheduling problem

Christian Artigues

Résumé

The classical time-indexed 0-1 linear programming formulations for the resource-constrained project scheduling problem involve binary variables indicating whether an activity starts precisely at or before a given time period. In the literature, references to less classical ''on/off'' formulations, that involve binary variables indicating whether an activity is in progress during a time period, can also be found. These formulations were not compared to the classical ones in terms of linear programming (LP) relaxations. In this paper we show that the previously proposed on/off formulations are weaker than the classical formulations and we obtain a stronger on/off formulation via non singular transformations of the classical formulations. We also remark that additional time-indexed formulations, presented as appealing in the literature, are in fact either weaker or equivalent to the classical ones.
Fichier principal
Vignette du fichier
short-time-indexed.pdf (232.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00833321 , version 1 (12-06-2013)

Identifiants

  • HAL Id : hal-00833321 , version 1

Citer

Christian Artigues. A note on time-indexed formulations for the resource-constrained project scheduling problem. 2013. ⟨hal-00833321⟩
194 Consultations
684 Téléchargements

Partager

Gmail Facebook X LinkedIn More