Scatter search for multi-mode resource-constrained project scheduling problems

In this paper the multi-mode resource-constrained project scheduling problem is considered. Activities are non-preemptable, resources are renewable, and the objective is to minimize the project duration (or makespan). A local search metaheuristic-scatter search is proposed to solve this strongly NP-hard problem. A comprehensive computational experiment is described, performed on a set of instances based on standard test problems constructed by the proGen project generator. The performance of this scatter search algorithm is compared with the performance of other published algorithms for multi-mode resource-constrained project scheduling problem, the results are analyzed and discussed and some conclusions are given.

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

[2]  Heng Li,et al.  Multimode Project Scheduling Based on Particle Swarm Optimization , 2006, Comput. Aided Civ. Infrastructure Eng..

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

[4]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

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

[6]  Roman Słowiński,et al.  DSS for multiobjective project scheduling , 1994 .

[7]  Andreas Drexl,et al.  Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .

[8]  F. F. Boctor.  Heuristics for scheduling projects with resource restrictions and several resource-duration modes , 1993 .

[9]  Bassem Jarboui,et al.  A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems , 2008, Appl. Math. Comput..

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

[11]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints , 1995 .

[12]  RAINER KOLISCH,et al.  Local search for nonpreemptive multi-mode resource-constrained project scheduling , 1997 .

[13]  Arno Sprecher,et al.  Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm , 1998, Eur. J. Oper. Res..

[14]  Arno Sprecher,et al.  Resource-Constrained Project Scheduling: Exact Methods for the Multi-Mode Case , 1994 .

[15]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998 .

[16]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[17]  Fayez F. Boctor,et al.  A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes , 1996 .

[18]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

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

[20]  Linet Özdamar,et al.  A genetic algorithm approach to a general category project scheduling problem , 1999, IEEE Trans. Syst. Man Cybern. Part C.

[21]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998, Networks.