Article contents
A branch-and-cut algorithmfor a resource-constrained scheduling problem
Published online by Cambridge University Press: 21 August 2007
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.
- Type
- Research Article
- Information
- RAIRO - Operations Research , Volume 41 , Issue 3: Journées Polyèdres et Optimisation Combinatoire , July 2007 , pp. 235 - 251
- Copyright
- © EDP Sciences, ROADEF, SMAI, 2007
References
- 4
- Cited by