A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times

摘要

We consider the problem of scheduling multiple projects subject to joint resource constraints. Most approaches proposed in the literature so far are based on the unrealistic assumption that resources can be transferred from one project to the other without any expense in time or cost. In order to con_tribute to closing this gap to reality, we generalise the multi-project scheduling problem by addition_ally including sequence- and resource-dependent transfer times, which represent setup activities necessary when a resource is removed from one project and reassigned to another (or from one job to another within the same project). In this paper, we define the modified resource constrained multi-project scheduling problem with transfer times (called RCMPSPTT), which aims at minimising the multi-project duration for the single-project approach or the mean project duration for the multi-project approach. We formulate both perspectives as an integer linear program, propose prior_ity rule based solution procedures and present results of comprehensive computational experiments. Provided that the combination of scheduling scheme and priority rules is chosen appropriately, the procedures obtain good results. In particular, resource oriented priority rules are identified to be successful.