Graph decomposition into paths under length constraints (2008)
Teypaz, Nicolas, Rapine, Christophe
Given 2 integers a and b, we define an (a,b)-decomposition of a graph G =(V,E) as a partition of E into paths where the length of each path lies between a and b. In this definition paths are...
Akbalik, Ayse, Rapine, Christophe
This paper presents polynomial time algorithms for three extensions of the classical capacitated lot sizing problem (CLSP). We consider a constant batch size production with a fixed cost associated...
Graph decomposition into paths under length constraints (2008)
Teypaz, Nicolas, Rapine, Christophe
Given 2 integers a and b, we define an (a,b)-decomposition of a graph G =(V,E) as a partition of E into paths where the length of each path lies between a and b. In this definition paths are...
Akbalik, Ayse, Rapine, Christophe
This paper presents polynomial time algorithms for three extensions of the classical capacitated lot sizing problem (CLSP). We consider a constant batch size production with a fixed cost associated...
A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (2008)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors whose execution time depends on the amount of resources alloted to is. This paper presents a new...
A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (2008)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors whose execution time depends on the amount of resources alloted to is. This paper presents a new...
Operator Non-Availability Periods (2007)
Brauner, Nadia, Finke, Gerd, Lehoux-Lebacque, Vassilissa, Rapine, Christophe, Potts, Chris, Strusevich, Vitaly
In scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the...
Operator Non-Availability Periods (2007)
Brauner, Nadia, Finke, Gerd, Lehoux-Lebacque, Vassilissa, Rapine, Christophe, Potts, Chris, Strusevich, Vitaly
In scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the...
Efficient Approximation Algorithms for Scheduling Malleable Tasks (2004)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors, its execution time depend- ing on the amount of resources allotted to it. According to the...
Efficient Approximation Algorithms for Scheduling Malleable Tasks (2004)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors, its execution time depend- ing on the amount of resources allotted to it. According to the...
Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (2002)
Gregory Mounie, Christophe Rapine
A malleable task is a computational unit that may be executed on any arbitrary number of processors, whose execution time depends on the amount of resources allotted to it. This paper presents a new...
Efficient Approximation Algorithms for Scheduling Malleable Tasks (2002)
Gregory Mounie, Christophe Rapine, Denis Trystram
A malleable task is a computational unit which may be executed on any arbitrary number of processors, its execution time depending on the amount of resources allotted to it. According to the standard...
A Dynamic Programming Algorithm for the Single Machine Total (2001)
Chrif Sadfi, Bernard Penz, Christophe Rapine
In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. The problem is known to be NP-hard. We propose a pseudo-polynomial dynamic...
A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (2001)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors whose execution time depends on the amount of resources alloted to is. This paper presents a new...
A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (2001)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors whose execution time depends on the amount of resources alloted to is. This paper presents a new...
Rapine, Christophe., Institut National Polytechnique De Grenoble.
Thèse (Doctorat) -- Institut national polytechnique de Grenoble, 1999.
Efficient Approximation Algorithms for Scheduling Malleable Tasks (1999)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors, its execution time depend- ing on the amount of resources allotted to it. According to the...
Efficient Approximation Algorithms for Scheduling Malleable Tasks (1999)
Mounié, Grégory, Rapine, Christophe, Trystram, Denis
A malleable task is a computational unit which may be executed on any arbitrary number of processors, its execution time depend- ing on the amount of resources allotted to it. According to the...
On-Line Scheduling of Parallelizable Jobs (1998)
Christophe Rapine, Isaac D. Scherson
. We consider the problem of efficiently executing a set of parallel jobs on a parallel machine by effectively scheduling the jobs on the computer's resources. This problem is one of optimization of...