Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times

Abstract In this paper, a multi-mode resource-constrained project scheduling problem with schedule-dependent setup times is considered. A schedule-dependent setup time is defined as a setup time dependent on the assignment of resources to activities over time, when resources are, e.g., placed in different locations. In such a case, the time necessary to prepare the required resource for processing an activity depends not only on the sequence of activities but, more generally, on the locations in which successive activities are executed. Activities are non-preemptable, resources are renewable, and the objective is to minimize the project duration. A local search metaheuristic—tabu search is proposed to solve this strongly NP-hard problem, and it is compared with the multi-start iterative improvement method as well as with random sampling. A computational experiment is described, performed on a set of instances based on standard test problems constructed by the ProGen project generator. The algorithms are computationally compared, the results are analyzed and discussed, and some conclusions are given.

[1]  Arno Sprecher,et al.  An exact algorithm for project scheduling with multiple modes , 1997 .

[2]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[3]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[4]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[5]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

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

[7]  Jarek Nabrzyski,et al.  Grid resource management: state of the art and future trends , 2004 .

[8]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[9]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[10]  Chung-Hsing Yeh,et al.  Simulated annealing for multi-mode project scheduling , 2003 .

[11]  Grzegorz Waligóra,et al.  Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling , 2001, Ann. Oper. Res..

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

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

[14]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[15]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[16]  Grzegorz Waligóra,et al.  A metaheuristic approach to scheduling workflow jobs on a Grid , 2004 .

[17]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

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

[19]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[20]  Christoph Schwindt,et al.  Resource allocation in project management , 2005 .

[21]  V J Rayward-Smith.  Project Scheduling: Recent Models, Algorithms and Applications , 2001, J. Oper. Res. Soc..