Carlier Jacques

Jacques Carlier

Information about the author Jacques Carlier will soon be added to the site.
Found 15 papers in total
The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
2014
In this paper, we study an interpretation of the sample‐based approach to...
A preemptive bound for the Resource Constrained Project Scheduling Problem
A preemptive bound for the Resource Constrained Project Scheduling Problem
2014
The Resource Constrained Project Scheduling Problem is one of the most intensively...
An Exact Method for Solving the Multi‐Processor Flow‐Shop
An Exact Method for Solving the Multi‐Processor Flow‐Shop
2000
The aim of this paper is to present a new branch and bound method for solving the...
Two‐stage hybrid flow shop with precedence constraints and parallel machines at second stage
Two‐stage hybrid flow shop with precedence constraints and parallel machines at second stage
2012
This study deals with the two‐stage hybrid flow shop (HFS) problem with...
Exact resolution of the one‐machine sequencing problem with no machine idle time
Exact resolution of the one‐machine sequencing problem with no machine idle time
2010
This paper investigates the one‐machine sequencing problem in a workshop where...
Dominance rules in combinatorial optimization problems
Dominance rules in combinatorial optimization problems
2011
The aim of this paper is to study the concept of a ‘dominance rule’ in the...
A new constraint programming approach for the orthogonal packing problem
A new constraint programming approach for the orthogonal packing problem
2008
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set...
Computing redundant resources for the resource constrained project scheduling problem
Computing redundant resources for the resource constrained project scheduling problem
2007
Several efficient lower bounds and time-bound adjustment methods for the resource...
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
2007
The two-dimensional bin-packing problem (2 BP ) consists of minimizing the number of...
A new exact method for the two-dimensional bin-packing problem with fixed orientation
A new exact method for the two-dimensional bin-packing problem with fixed orientation
2007
We propose a new exact method for the well-known two-dimensional bin-packing problem....
Heuristic and metaheuristic methods for computing graph treewidth
Heuristic and metaheuristic methods for computing graph treewidth
2004
The notion of treewidth is of considerable interest in relation to NP-hard problems....
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
2004
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on...
A new LP-based lower bound for the cumulative scheduling problem
A new LP-based lower bound for the cumulative scheduling problem
2000
This paper deals with the computation of lower bounds for Cumulative Scheduling...
Two branch and bound algorithms for the permutation flow shop problem
Two branch and bound algorithms for the permutation flow shop problem
1996
The objective of this paper is to present two exact methods for the permutation flow...
A branch and bound method for solving scheduling problems with cumulative constraints
A branch and bound method for solving scheduling problems with cumulative constraints
1991
This paper presents a procedure for scheduling in a minimal makespan a project subject...
Papers per page: