On the strength of time-indexed formulations for the resource-constrained project scheduling problem - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Journal Articles Operations Research Letters Year : 2017

On the strength of time-indexed formulations for the resource-constrained project scheduling problem

Abstract

For non-preemptive scheduling, time-indexed zero-one linear programming formulations have been deeply analyzed. This note clarifies the current knowledge about the strength of these formulations and shows that some formulations that have been proposed " new " in the literature are in fact weaker or equivalent to those already known. Much of the arguments used follow from a PhD thesis by Sousa, which has been largely overlooked in the literature.
Fichier principal
Vignette du fichier
Artigues-ORL-author.pdf (258.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01461447 , version 1 (08-02-2017)

Identifiers

Cite

Christian Artigues. On the strength of time-indexed formulations for the resource-constrained project scheduling problem. Operations Research Letters, 2017, 45 (2), pp.154-159. ⟨10.1016/j.orl.2017.02.001⟩. ⟨hal-01461447⟩
175 View
797 Download

Altmetric

Share

Gmail Facebook X LinkedIn More