Christophe Rapine
Orcid: 0000-0003-4987-8933
According to our database1,
Christophe Rapine
authored at least 37 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Makespan Minimization for Scheduling on Heterogeneous Platforms with Precedence Constraints.
Proceedings of the Euro-Par 2024: Parallel Processing, 2024
2017
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints.
Math. Oper. Res., 2017
An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels.
Eur. J. Oper. Res., 2017
2016
Transp. Sci., 2016
High-multiplicity scheduling on one machine with forbidden start and completion times.
J. Sched., 2016
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales.
Eur. J. Oper. Res., 2016
Eur. J. Oper. Res., 2016
2015
IEEE Trans. Intell. Transp. Syst., 2015
Optim. Lett., 2015
2014
Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand.
Eur. J. Oper. Res., 2014
Proceedings of the International Conference on Control, 2014
2013
The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases.
Eur. J. Oper. Res., 2013
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times.
Discret. Optim., 2013
Discret. Appl. Math., 2013
2012
J. Sched., 2012
Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost.
Oper. Res. Lett., 2012
2011
A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate.
Eur. J. Oper. Res., 2010
2009
2008
Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand.
Eur. J. Oper. Res., 2008
Ann. Oper. Res., 2008
2007
SIAM J. Comput., 2007
2005
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints.
Eur. J. Oper. Res., 2005
2002
An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Yasmine Hammamet, Tunisia, October 6-9, 2002, 2002
2001
Electron. Notes Discret. Math., 2001
1999
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999
1998
Proceedings of the Euro-Par '98 Parallel Processing, 1998
1997
Worst Case Analysis of Lawler's Algorithm for Scheduling Trees with Communication Delays.
IEEE Trans. Parallel Distributed Syst., 1997
1996
Proceedings of the Euro-Par '96 Parallel Processing, 1996
1995
Scheduling Strategies for Parallel Programming Environments.
Proceedings of the Parallel Computing: State-of-the-Art and Perspectives, 1995