Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling

Authors:
Celso Tchao;Simone L. Martins
Affiliations:
Instituto Aerus de Seguridade Social, Rio de Janeiro, Brazil;Departamento de Ciência de Computação, Universidade Federal Fluminense, Niterói, Brazil
Venue:
Learning and Intelligent Optimization
Year:
2008

Citing 7
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Tabu Search

Tabu Search
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

INFORMS Journal on Computing
Path relinking for the vehicle routing problem

Journal of Heuristics
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

INFORMS Journal on Computing
New heuristics for the maximum diversity problem

Journal of Heuristics
A genetic algorithm approach to a general category projectscheduling problem

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes some tabu search based heuristics with path relinking for the multi-mode resource-constrained project scheduling problem. Path relinking is used as a post optimization strategy, so that it explores paths that connect elite solutions found by the tabu search based heuristics. Computational results show that path relinking is able to improve the tabu search based heuristics, and that these hybrid heuristics are able to find good quality solutions in quite short computational times.