Article Dans Une Revue RAIRO - Operations Research Année : 2007

A branch-and-cut algorithm for a resource-constrained scheduling problem

Résumé

This paper is devoted to the exact resolution of a strongly NP-hard resource-constrained scheduling problem, the Process Move Programming problem, which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance, in terms of both exact and approximate resolution when the instance size increases.

Fichier principal
Vignette du fichier
RAIRO.pdf (168.46 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

inria-00311533 , version 1 (18-08-2008)

Licence

Identifiants

Citer

Renaud Sirdey, Hervé Kerivin. A branch-and-cut algorithm for a resource-constrained scheduling problem. RAIRO - Operations Research, 2007, 41 (3), pp.235-251. ⟨10.1051/ro:2007021⟩. ⟨inria-00311533⟩
288 Consultations
337 Téléchargements

Altmetric

Partager

  • More