A branch-and-cut algorithm for a resource-constrained scheduling problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles RAIRO - Operations Research Year : 2007

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

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
121 View
156 Download

Altmetric

Share

Gmail Facebook X LinkedIn More