Hybrid local search techniques for the resource-constrained project scheduling problem

Authors:
Igor Pesek;Andrea Schaerf;Janez Žerovnik
Affiliations:
IMFM, Ljubljana, Slovenia;DIEGM, University of Udine, Udine, Italy;IMFM, Ljubljana, Slovenia and FS, University of Maribor, Maribor, Slovenia
Venue:
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Year:
2007

Citing 7
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

Management Science
Tabu Search

Tabu Search
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

Operations Research
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms

Software—Practice & Experience
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications

Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-constrained project scheduling problem (RCPSP). We perform an experimental analysis to tune the parameters of our algorithm and to compare it with a tabu search based on a combination of neighborhood relations borrowed from the literature. Finally, we show that our algorithm is also competitive with the ones reported in the literature.