Jacques Carlier

According to our database1, Jacques Carlier authored at least 60 papers between 1991 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


An <i>O</i>(<i>n</i><sup>2</sup>) algorithm for time-bound adjustments for the cumulative scheduling problem.
Eur. J. Oper. Res., 2020

An automatic restoration scheme for switch-based networks.
Ad Hoc Networks, 2019

Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources.
Discret. Appl. Math., 2018

Exploration of de Bruijn Graph Filtering for de novo Assembly Using GraphLab.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Leveraging distributed GraphLab for program trace analysis.
Proceedings of the International Conference on High Performance Computing & Simulation, 2016

The data transfer problem in a system of systems.
Eur. J. Oper. Res., 2015

A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures.
4OR, 2015

A preemptive bound for the Resource Constrained Project Scheduling Problem.
J. Sched., 2014

The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks.
J. Heuristics, 2014

A GRASP for Placement and Routing of Dataflow Process Networks on Many-Core Architectures.
Proceedings of the Eighth International Conference on P2P, 2013

A Fully Distributed Resilient Routing Scheme for Switch-Based Networks.
Proceedings of the Eighth International Conference on P2P, 2013

Integer preemptive scheduling on parallel machines.
Oper. Res. Lett., 2012

Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage.
Comput. Oper. Res., 2012

A restoration scheme for virtual networks using switches.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

Dominance rules in combinatorial optimization problems.
Eur. J. Oper. Res., 2011

Properties of optimal schedules in preemptive shop scheduling.
Discret. Appl. Math., 2011

Probabilistic Parameters of Conditional Task Graphs.
Proceedings of the 14th International Conference on Network-Based Information Systems, 2011

Task Ordering and Memory Management Problem for Degree of Parallelism Estimation.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

An optimization-based heuristic for the robotic cell problem.
Eur. J. Oper. Res., 2010

Exact Method for Robotic Cell Problem.
Electron. Notes Discret. Math., 2010

Speculative data prefetching for branching structures in dataflow programms.
Electron. Notes Discret. Math., 2010

Exact resolution of the one-machine sequencing problem with no machine idle time.
Comput. Ind. Eng., 2010

Approximate solution of a resource-constrained scheduling problem.
J. Heuristics, 2009

The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm.
Discret. Appl. Math., 2009

Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time.
Proceedings of the ICINCO 2009, 2009

Integrality Property in Preemptive Parallel Machine Scheduling.
Proceedings of the Computer Science, 2009

Dominance-based heuristics for one-machine total cost scheduling problems.
Eur. J. Oper. Res., 2008

Discret. Appl. Math., 2008

A new constraint programming approach for the orthogonal packing problem.
Comput. Oper. Res., 2008

A new exact method for the two-dimensional bin-packing problem with fixed orientation.
Oper. Res. Lett., 2007

On a resource-constrained scheduling problem with application to distributed systems reconfiguration.
Eur. J. Oper. Res., 2007

A new exact method for the two-dimensional orthogonal packing problem.
Eur. J. Oper. Res., 2007

Computing redundant resources for the resource constrained project scheduling problem.
Eur. J. Oper. Res., 2007

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation.
Comput. Oper. Res., 2007

Branch-and-Bound Algorithms for TotalWeighted Tardiness.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Elimination Rules for Job-Shop Scheduling Problem.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Heuristic and metaheuristic methods for computing graph treewidth.
RAIRO Oper. Res., 2004

A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates.
Eur. J. Oper. Res., 2004

Jackson's pseudo-preemptive schedule and cumulative scheduling problems.
Discret. Appl. Math., 2004

Ann. Oper. Res., 2004

On linear lower bounds for the resource constrained project scheduling problem.
Eur. J. Oper. Res., 2003

New Lower and Upper Bounds for Graph Treewidth.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Exact procedures for single machine total cost scheduling.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics: Bridging the Digital Divide, Yasmine Hammamet, Tunisia, October 6-9, 2002, 2002

Assigning spare capacities in mesh survivable networks.
Telecommun. Syst., 2000

An Exact Method for Solving the Multi-Processor Flow-Shop.
RAIRO Oper. Res., 2000

A new LP-based lower bound for the cumulative scheduling problem.
Eur. J. Oper. Res., 2000

Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs.
Algorithmica, 2000

Discret. Appl. Math., 1999

An Exact Method for Minimizing the Makespan of an Application Processed on a Master Slave Bus Oriented Multiprocessor System.
Discret. Appl. Math., 1999

Issues in Distributed Rerouting On High Speed Networks.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

Jackson's Pseudo Preemptive Schedule for the <i>Pm</i>/<i>r</i> <sub> <i>i</i> </sub>, <i>q</i> <sub> <i>i</i> </sub>/<i>C</i> <sub> <i>max</i> </sub> scheduling problem.
Ann. Oper. Res., 1998

An Optimal Routing Technique: the Proportional Routing.
Proceedings of the Distributed Computing, 1998

Reliability Evaluation of Large Telecommunication Networks.
Discret. Appl. Math., 1997

Contribution in Assignment of Spare Capacities in Reconfigurable.
Proceedings of the On Principles Of Distributed Systems, 1997

Bounds and adjustments associated with the Pm/r<sub>i</sub>, q<sub>i</sub>/Cmax scheduling problem.
Proceedings of the JFPLC'97, 1997

A Decomposition Algorithm for Network Reliability Evaluation.
Discret. Appl. Math., 1996

Distributed Rerouting in DCS Mesh Networks.
Proceedings of the Combinatorics and Computer Science, 1995

Evaluation of telecommunication network performances.
Proceedings of the System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, 1993

SAT versus UNSAT.
Proceedings of the Cliques, 1993

Probabilistic approach to the Satisfiability Problem.
Theor. Comput. Sci., 1991