Evolutionary Local Search with Variable Neighborhood for the Resource Constrained Project Scheduling Problem

Abstract

In this paper we consider the resource constrained project scheduling problem. We propose an evolutionary algorithm based on path relinking strategy and tabu search with variable neighborhood. Computational experiments are made for the PSPLib data set. For most benchmarks the algorithm found best known solutions. For several test instances the best solutions was improved. 1.