A flow-based tabu search algorithm for the RCPSP with transfer times

In this paper, we propose a tabu search algorithm for the resource-constrained project scheduling problem with transfer times. Solutions are represented by resource flows extending the disjunctive graph model for shop scheduling problems. Neighborhoods are defined by parallel and serial modifications rerouting or reversing flow on certain arcs. This approach is evaluated from a theoretical and experimental point of view. Besides studying the connectivity of different neighborhoods, computational results are presented for benchmark instances with and without transfer times.

[1]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[2]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[3]  Sönke Hartmann,et al.  A survey of variants and extensions of the resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

[4]  Armin Scholl,et al.  Managing and modelling general resource transfers in (multi-)project scheduling , 2010, OR Spectr..

[5]  Christian Artigues,et al.  A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes , 2000, Eur. J. Oper. Res..

[6]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[7]  Manuel Laguna,et al.  Tabu Search , 1997 .

[8]  Grzegorz Waligóra,et al.  Modelling Setup Times in Project Scheduling , 2006 .

[9]  Doreen Krüger.  Multi-project scheduling with resource transfers , 2009 .

[10]  Mario Vanhoucke.  Setup times and fast tracking in resource-constrained project scheduling , 2008, Comput. Ind. Eng..

[11]  Christian Artigues.  The Resource‐Constrained Project Scheduling Problem , 2010 .

[12]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[13]  Peter Brucker,et al.  Complex Scheduling , 2006 .

[14]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[15]  Rainer Kolisch,et al.  Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem , 1995 .

[16]  Norbert Trautmann,et al.  Scheduling the production of rolling ingots: industrial context, model, and solution method , 2003 .

[17]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[18]  Armin Scholl,et al.  A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times , 2009 .

[19]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[20]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[21]  Sigrid Knust,et al.  List scheduling in a parallel machine environment with precedence constraints and setup times , 2001, Oper. Res. Lett..

[22]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[23]  Sigrid Knust,et al.  Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers , 2016, EURO J. Comput. Optim..

[24]  Christian Artigues,et al.  Insertion techniques for static and dynamic resource-constrained project scheduling , 2003, Eur. J. Oper. Res..

[25]  Norbert Trautmann,et al.  Batch scheduling in process industries: an application of resource–constrained project scheduling , 2000, OR Spectr..