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

• Published in: European journal of operational research Vol. 197; no. 2; pp. 492 - 508
• Main Authors: Krüger, Doreen, Scholl, Armin
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.09.2009; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Applied sciences; Combinatorial optimisation; Exact sciences and technology; Flows in networks. Combinatorial problems; Integer programming; Job shops; Mathematical model; Mathematical programming; Operational research and scientific management; Operational research. Management science; Project management; Project scheduling; Project scheduling Combinatorial optimisation Mathematical model Transfer times Setup; Resource allocation; Scheduling; Scheduling algorithms; Scheduling, sequencing; Setup; Studies; Transfer times; Transfer times; Project scheduling; Combinatorial optimisation; Mathematical model; Setup; Project management; Priority; Expert system; Linear programming; Scheduling; Combinatorial optimization; Synchronization; Modeling; Integer programming; Time dependence; Resource constraint; Heuristic method; Setup time; Resource management
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2008.07.036

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 contribute to closing this gap to reality, we generalise the multi-project scheduling problem by additionally 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 priority 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.