A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling

We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as a solution combination method. Computational results on randomly generated problem sets are compared with the best available results indicating the efficiency of the proposed algorithm.

[1]  Rubén Ruiz,et al.  Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms , 2003, J. Oper. Res. Soc..

[2]  Francisco Ballestín,et al.  Justification and RCPSP: A technique that pays , 2005, Eur. J. Oper. Res..

[3]  Roman Słowiński,et al.  Two Approaches to Problems of Resource Allocation Among Project Activities — A Comparative Study , 1980 .

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

[5]  Francisco Ballestín,et al.  Resource-constrained project scheduling: A critical activity reordering heuristic , 2003, Eur. J. Oper. Res..

[6]  Erik Demeulemeester,et al.  Local search methods for the discrete time/resource trade‐off problem in project networks , 1998 .

[7]  Y. Kochetov,et al.  Evolutionary Local Search with Variable Neighborhood for the Resource Constrained Project Scheduling Problem , 2003 .

[8]  Toshihide Ibaraki,et al.  Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem , 2002 .

[9]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[10]  María Pilar Tormos,et al.  A Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling , 2001, Ann. Oper. Res..

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

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

[13]  Robert J Willis,et al.  An iterative scheduling technique for resource-constrained project scheduling , 1992 .

[14]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

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

[16]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

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

[18]  Mohammad Ranjbar,et al.  Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms , 2007, Appl. Math. Comput..

[19]  Sönke Hartmann,et al.  A self‐adapting genetic algorithm for project scheduling under resource constraints , 2002 .

[20]  Erik Demeulemeester,et al.  The discrete time/resource trade-off problem in project networks: a branch-and-bound approach , 2000 .

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

[22]  Bert De Reyck,et al.  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..

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

[24]  Vinícius Amaral Armentano,et al.  Scatter search for project scheduling with resource availability cost , 2006, Eur. J. Oper. Res..

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

[26]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[27]  Concepción Maroto,et al.  A Robust Genetic Algorithm for Resource Allocation in Project Scheduling , 2001, Ann. Oper. Res..

[28]  Pilar Tormos,et al.  An efficient multi-pass heuristic for project scheduling with constrained resources , 2003 .

[29]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .