A note on "event-based MILP models for resource-constrained project scheduling problems" - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2013

A note on "event-based MILP models for resource-constrained project scheduling problems"

(1) , (2) , (2) , (3) , (1) , (4)
1
2
3
4

Résumé

Recently, new mixed integer linear programming formulations for the resource-constrained project scheduling problem were proposed by Kone et al. [3]. Unfortunately, the presentation of the first new model (called start/end-based formulation SEE) was not correct. More precisely, a set of necessary constraints representing the relative positioning of start and end events of activities was unintentionally omitted in the paper although it was present in the integer program used for the computational experiments. After presenting a counterexample showing the incorrectness, we provide a disaggregated and an aggregated variant of the set of necessary constraints, the disaggregated formulation yielding in theory a better linear programming relaxation. We present computational results showing that although the linear programming relaxations of both formulations yield equivalently poor lower bounds, the disaggregated formulation shows in average a better performance for integer solving of a well-known set of 30-activity instances.
Fichier non déposé

Dates et versions

hal-00918016 , version 1 (08-03-2018)

Identifiants

Citer

Christian Artigues, Peter Brucker, Sigrid Knust, Oumar Koné, Pierre Lopez, et al.. A note on "event-based MILP models for resource-constrained project scheduling problems". Computers and Operations Research, 2013, 40 (4), pp.1060-1063. ⟨10.1016/j.cor.2012.10.018⟩. ⟨hal-00918016⟩
207 Consultations
5 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More