#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2001

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim
- Computers & OR
- 2008

- Antoine Jouglet, Philippe Baptiste, Jacques Carlier
- Handbook of Scheduling
- 2004

- Antoine Jouglet, Ceyda Oguz, Marc Sevaux
- J. Math. Model. Algorithms
- 2009

- Philippe Baptiste, Antoine Jouglet
- RAIRO - Operations Research
- 2001

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch| P Ti is known to be NP-Hard in the… (More)

- Antoine Jouglet, Jacques Carlier
- European Journal of Operational Research
- 2011

The aim of this paper is to study the concept of a “dominance rule” in the context of combinatorial optimization. A dominance rule is established in order to reduce the solution space of a problem by adding new constraints to it, either in a procedure that aims to reduce the domains of variables, or directly in building interesting solutions. Dominance… (More)

- Philippe Baptiste, Jacques Carlier, Antoine Jouglet
- European Journal of Operational Research
- 2004

In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. We introduce new lower bounds and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. Computational results show that the proposed… (More)

- Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste
- European Journal of Operational Research
- 2008

We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time. We describe dominance rules for these criteria, as well as techniques for using these dominance rules to build heuristic solutions. We use them to improve certain well-known… (More)

- M. Sevaux, A. Jouglet, C. Oğuz
- 2005

A constraint programming based branch-and-bound algorithm is embedded into a memetic algorithm to solve multiprocessor task scheduling problem in hybrid flow-shop environments. Both methods are able to solve the problem by themselves but the combination of the two allows to solve larger problem in a shorter amount of time. Computational experiments are… (More)

- Thierry Denoeux, Nicole El Zoghby, Véronique Berge-Cherfaoui, Antoine Jouglet
- IEEE Trans. Cybernetics
- 2014

Object association is a crucial step in target tracking and data fusion applications. This task can be formalized as the search for a relation between two sets (e.g., a sets of tracks and a set of observations) in such a way that each object in one set is matched with at most one object in the other set. In this paper, this problem is tackled using the… (More)

We study the parallel machine scheduling problem with release dates and we consider several “min-sum” objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to… (More)