Author:

Keywords:

project scheduling, heuristics, scatter search, electromagnetism, genetic algorithm, resource constraints, search, classification, Social Sciences, Science & Technology, Technology, Management, Operations Research & Management Science, Business & Economics, GENETIC ALGORITHM, RESOURCE, CLASSIFICATION, Operations Research, 40 Engineering, 46 Information and computing sciences, 49 Mathematical sciences

Abstract:

In the last few decades, several effective algorithms for solving the resource-con strained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory. We present computational experiments on standard benchmark datasets, compare the results with current state-of-the-art heuristics, and show that the procedure is capable of producing consistently good results for challenging instances of the resource-constrained project scheduling problem. We also demonstrate that the algorithm outperforms state-of-the-art existing heuristics. (c) 2004 Elsevier B.V. All rights reserved.