A Multi-mode project scheduling problem with a single nonrenewable resource

Download
2017
Altıntaş, Cansu
In this thesis, we consider a multi-mode project scheduling problem with a single nonrenewable resource. We assume that the resource is released in pre-specified times at pre-specified quantities and the resource is consumed at activity completions. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. Our problem is to select the modes and timings of the activities so as to minimize the project completion time. We develop a mixed integer linear model and present a branch and bound algorithm. The results of our experiments have revealed that the mathematical model can handle only small-sized problem instances with up to 20 tasks and branch and bound algorithm can solve problem instances with up to 100 tasks for some resource release profiles.