Christophe Rapine

Orcid: 0000-0003-4987-8933

According to our database1, Christophe Rapine authored at least 36 papers between 1995 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Approximation Algorithms for the Open Shop Problem with Delivery Times.
CoRR, 2017

2016
Subliminal Speed Control in Air Traffic Management: Optimization and Simulation.
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

The single-item green lot-sizing problem with fixed carbon emissions.
Eur. J. Oper. Res., 2016

2015
Equity-Oriented Aircraft Collision Avoidance Model.
IEEE Trans. Intell. Transp. Syst., 2015

Multi-item uncapacitated lot sizing problem with inventory bounds.
Optim. Lett., 2015

Capacitated lot sizing problems with inventory bounds.
Ann. Oper. Res., 2015

2014
A 4D-sequencing approach for air traffic management.
Eur. J. Oper. Res., 2014

Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand.
Eur. J. Oper. Res., 2014

Single-item lot sizing problem with carbon emission under the cap-and-trade policy.
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

Lot sizing with carbon emission constraints.
Eur. J. Oper. Res., 2013

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times.
Discret. Optim., 2013

Approximations for the Two-Machine Cross-Docking Flow Shop Problem.
Discret. Appl. Math., 2013

2012
Single machine scheduling with small operator-non-availability periods.
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

Two-stage flexible-choice problems under uncertainty.
Eur. J. Oper. Res., 2010

2009
Operator non-availability periods.
4OR, 2009

2008
Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand.
Eur. J. Oper. Res., 2008

Bicriteria scheduling for contiguous and non contiguous parallel tasks.
Ann. Oper. Res., 2008

2007
A 3/2-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks.
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

Portfolio selection and scheduling on a single machine environment.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Yasmine Hammamet, Tunisia, October 6-9, 2002, 2002

2001
Sensitivity analysis of scheduling algorithms.
Eur. J. Oper. Res., 2001

Scheduling with Duplication on m Processors with Small Communication Delays.
Electron. Notes Discret. Math., 2001

1999
Efficient Approximation Algorithms for Scheduling Malleable Tasks.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998
On-Line Scheduling of Parallelizable Jobs.
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
Iterative Approach for the Clustering Problem.
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


  Loading...