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

Christian Artigues 1
1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
LAAS - Laboratoire d'analyse et d'architecture des systèmes
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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01461447
Contributor : Christian Artigues <>
Submitted on : Wednesday, February 8, 2017 - 10:51:04 AM
Last modification on : Friday, January 10, 2020 - 9:10:16 PM
Long-term archiving on: Tuesday, May 9, 2017 - 12:31:47 PM

File

Artigues-ORL-author.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

278

Files downloads

545