Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
489457 | Procedia Computer Science | 2015 | 8 Pages |
This paper proposes a mixed-integer linear programming (MILP) time driven RCCP model that handles different planning levels by varying the length of the time periods. The model is based on the continuous time representation of work packages’ start and end events and the discrete time representation of resource constraints. The model considers shorter period lengths at the beginning of the planning horizon to produce a detailed plan, while further periods cover a larger span. The proposed model is compared to a RCCP model with fixed period lengths. Both models were tested on medium-sized project instances. The computational results proved that the proposed model performs considerably better in terms of computational times. A reactive planning approach is also proposed to analyze the performance and robustness of both models. The results analysis showed that reducing resource capacities of aggregated periods by a percentage of 20% allowed us to obtain comparable results for the two models.