LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource

2015-01-01
Azizoğlu, Meral
ÇETİNKAYA, FERDA CAN
Pamir, Selin Kirbiyik
In this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and develop three heuristic procedures based on those relaxations. The results of our computational study have revealed the satisfactory performances of our lower bounds and heuristic procedures.