A GRASP for a resource-constrained scheduling problem

Authors:
Renaud Sirdey;Jacques Carlier;Dritan Nace
Affiliations:
CEA LIST, Embedded Real Time Systems Lab, Point Courrier 94, 91191 Gif-sur-Yvette Cedex, France.;UMR CNRS Heudiasyc, Universite de Technologie de Compiegne, Centre de Recherches de Royallieu, BP 20529, 60205 Compiegne Cedex, France.;UMR CNRS Heudiasyc, Universite de Technologie de Compiegne, Centre de Recherches de Royallieu, BP 20529, 60205 Compiegne Cedex, France
Venue:
International Journal of Innovative Computing and Applications
Year:
2010

Citing 4
Cited 0

An introduction to randomized algorithms

Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
Fault tolerance in distributed systems

Fault tolerance in distributed systems
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing
Approximate solution of a resource-constrained scheduling problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is devoted to the approximate resolution of a strongly NP-hard real world resource-constrained scheduling problem, which arises in relation to the operability of certain high availability real time distributed systems. We present a fast and pragmatic algorithm based on the GRASP metaheuristic and, building on previous research on exact resolution methods, extensive computational results demonstrating its practical ability to find solutions within a few percents to optimality on a wide spectrum of hard instances.