Antoine Jouglet

According to our database1, Antoine Jouglet authored at least 22 papers between 2001 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Robust routing in deterministic delay-tolerant networks.
Comput. Oper. Res., 2018

2017
Macroscopic evacuation plans for natural disasters.
OR Spectrum, 2017

Modeling elements and solving techniques for the data dissemination problem.
Eur. J. Oper. Res., 2017

A constraint-programming-based approach for solving the data dissemination problem.
Comput. Oper. Res., 2017

2016
Timetabling of sorting slots in a logistic warehouse.
Annals OR, 2016

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

2014
Optimal Object Association in the Dempster-Shafer Framework.
IEEE Trans. Cybernetics, 2014

2013
A New Graph-Theoretical Model for the Guillotine-Cutting Problem.
INFORMS Journal on Computing, 2013

Data Transfer in Delay-Tolerant Networks.
Proceedings of the 2013 Eighth International Conference on Broadband and Wireless Computing, 2013

2012
Single-machine scheduling with no idle time and release dates to minimize a regular criterion.
J. Scheduling, 2012

A Multi-Period Renewal equipment problem.
Eur. J. Oper. Res., 2012

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

Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates.
Comput. Oper. Res., 2011

2009
Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search.
J. Math. Model. Algorithms, 2009

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

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

A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
A new lower bound for the non-oriented two-dimensional bin-packing problem.
Oper. Res. Lett., 2007

2006
Lower bounds for parallel machines scheduling.
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

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

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

2001
On Minimizing Total Tardiness in a Serial Batching Problem.
RAIRO - Operations Research, 2001


  Loading...