Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling

Abstract

The most common approach in the multi-project scheduling literature considers resources as a common pool shared among all projects. However, different resource management strategies may be required for different problem environments. We present the relaxed resource dedication (RRD) policy, which prevents the sharing of resources among projects but allows resource transfers when a project starts after the completion of another one. We treat the case where the available amounts of resources - namely, the capacities - are decision variables subject to a limited budget. This capacity planning problem, called the resource portfolio problem, is investigated under the RRD policy employing both renewable and non-renewable resources with multiple modes of usage. A mixed integer linear programming model to minimise total weighted tardiness is proposed. To obtain some benchmark solutions for this hard problem, the branch and cut procedure of ILOG CPLEX is modified by customised branching strategies, feasible solution generation schemes and valid inequalities.