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
15 pagesThe classical time-indexed 0-1 linear programming formulations for the resource-constrained ...
Recently, Bianco and Caramia (Flex Serv Manuf J 25(1–2), 6–24, 2013) proposed a new model for the re...
Scheduling problems considered in the literature are often static (activities are known in advance a...
We compare, at a theoretical level, the RCPSP formulation proposed in [L. Bianco and M. Caramia, Fle...
International audienceFor non-preemptive scheduling, time-indexed zero-one linear programming formul...
This title presents a large variety of models and algorithms dedicated to the resource-constrained p...
In Resource Constrained Project Scheduling Problem (RCPSP) exact algorithms can only solve small in...
It is the purpose of this article to review the various solutions that have been proposed for the re...
In this paper we propose a new formulation for the Resource Constrained Project Scheduling Problem (...
International audienceIn this paper we make a comparative study of several mixed integer linear prog...
In this paper we propose a new formulation for the Resource Constrained Project Scheduling Problem (...
International audienceThis paper addresses an extension of the resource-constrained project scheduli...
chapter 6This chapter describes the main heuristics and metaheuristics that were proposed to approxi...
15 pagesThe classical time-indexed 0-1 linear programming formulations for the resource-constrained ...
Recently, Bianco and Caramia (Flex Serv Manuf J 25(1–2), 6–24, 2013) proposed a new model for the re...
Scheduling problems considered in the literature are often static (activities are known in advance a...
We compare, at a theoretical level, the RCPSP formulation proposed in [L. Bianco and M. Caramia, Fle...
International audienceFor non-preemptive scheduling, time-indexed zero-one linear programming formul...
This title presents a large variety of models and algorithms dedicated to the resource-constrained p...
In Resource Constrained Project Scheduling Problem (RCPSP) exact algorithms can only solve small in...
It is the purpose of this article to review the various solutions that have been proposed for the re...
In this paper we propose a new formulation for the Resource Constrained Project Scheduling Problem (...
International audienceIn this paper we make a comparative study of several mixed integer linear prog...
In this paper we propose a new formulation for the Resource Constrained Project Scheduling Problem (...
International audienceThis paper addresses an extension of the resource-constrained project scheduli...
chapter 6This chapter describes the main heuristics and metaheuristics that were proposed to approxi...
15 pagesThe classical time-indexed 0-1 linear programming formulations for the resource-constrained ...
Recently, Bianco and Caramia (Flex Serv Manuf J 25(1–2), 6–24, 2013) proposed a new model for the re...
Scheduling problems considered in the literature are often static (activities are known in advance a...