A combination of different resource management policies in a multi-project environment

Multi-project problem environments are defined according to the way resources are managed in the problem environment which is called the resource management policy (RMP) in this study. Different resource management policies can be defined according to the characteristics of the projects and/or resources in the problem environment. The most common RMP encountered in the multi-project scheduling literature is the resource sharing policy (RSP) where resources can be shared among projects without any costs or limitations. This policy can be seen as an extreme case since there is a strong assumption of unconstrained resource sharing. Another RMP can be defined as the other extreme such that resources cannot be shared among projects which is called resource the dedication policy (RDP). The last RMP considered in this study is between these two policies where resources are dedicated but can be transferred among projects when a project finishes, the dedicated resources to this project can be transferred to another one starting after the finish of the corresponding project. This RPM is called the resource transfer policy (RTP). In this study we investigate a problem environment where all these three types of RPM are present. Additionally, the general resource capacities are taken as decision variables that are constrained by a given general budget. We call this multi-project environment as the Generalized Resource Portfolio Problem (GRPP). We have investigated this problem and proposed an iterative solution approach based on exact solution methods which determines the general resource capacities from the budget, resource dedications, resource sharing and resource transfer decisions and schedules the individual projects. Computational results for over forty test problems are reported.