| Issue |
RAIRO-Oper. Res.
Volume 51, Number 3, July-September 2017
|
|
|---|---|---|
| Page(s) | 519 - 532 | |
| DOI | https://doi.org/10.1051/ro/2016036 | |
| Published online | 13 April 2017 | |
The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches
Dipartimento di Ingegneria dell’Impresa, Università di Roma “Tor Vergata”, Via del Politecnico, 1 - 00133 Roma, Italy.
bianco@dii.uniroma2.it; caramia@dii.uniroma2.it
Received: 24 April 2015
Accepted: 9 May 2016
We compare, at a theoretical level, the RCPSP formulation proposed in [L. Bianco and M. Caramia, Flexible Services and Manufacturing 25 (2013) 6–24.] with the main time indexed linear programming based mathematical models existing in the literature. This paper was inspired by the results of the experimental comparison among these models conducted in our previous work; in fact, such results showed that the formulation proposed by Bianco and Caramia bested the competing approaches. Here, by means of a theoretical analysis, we show the reason for this behaviour.
Mathematics Subject Classification: 90C11 / 90B35 / 90C90
Key words: Project scheduling / resource constraints / precedence constraints / mathematical model
© EDP Sciences, ROADEF, SMAI 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.