Christelle Guéret

Orcid: 0000-0002-8982-1619

According to our database1, Christelle Guéret authored at least 23 papers between 1995 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Surgical case scheduling with sterilising activity constraints.
Int. J. Prod. Res., 2019

2018
Introduction to the special issue on advances in vehicle routing and logistics optimization: heuristics.
EURO J. Transp. Logist., 2018

2015
Complexity of a one-to-one meeting scheduling problem with two types of actors.
J. Oper. Res. Soc., 2015

2014
Towards an approach to manage smart grids like any other power plant.
Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference, 2014

2013
Combinatorial optimization in production and logistics systems.
RAIRO Oper. Res., 2013

A parallel matheuristic for the technician routing and scheduling problem.
Optim. Lett., 2013

A review of dynamic vehicle routing problems.
Eur. J. Oper. Res., 2013

Joint-optimization of inventory policies on a multi-product multi-echelon pharmaceutical system with batching and ordering constraints.
Eur. J. Oper. Res., 2013

2012
An Optimal Constraint Programming Approach to the Open-Shop Problem.
INFORMS J. Comput., 2012

A constraint programming approach for a batch processing problem with non-identical job sizes.
Eur. J. Oper. Res., 2012

An event-driven optimization framework for dynamic vehicle routing.
Decis. Support Syst., 2012

2011
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands.
Transp. Sci., 2011

2010
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands.
Comput. Oper. Res., 2010

2009
A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter.
Proceedings of the Bio-inspired Algorithms for the Vehicle Routing Problem, 2009

2006
Complexity of flowshop scheduling problems with a new blocking constraint.
Eur. J. Oper. Res., 2006

2003
Loading aircraft for military operations.
J. Oper. Res. Soc., 2003

2002
Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2000
Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems.
Eur. J. Oper. Res., 2000

1999
A new lower bound for the open‐shop problem.
Ann. Oper. Res., 1999

1998
Classical and new heuristics for the open-shop problem: A computational evaluation.
Eur. J. Oper. Res., 1998

Utilisation du backtrack intelligent dans un branch-and-bound. Application au problème d'Open-Shop.
Proceedings of the JFPLC'98, 1998

1995
Building University Timetables Using Constraint Logic Programming.
Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995


  Loading...