Guret Christelle

Christelle Guret

Information about the author Christelle Guret will soon be added to the site.
Found 9 papers in total
Complexity of a one-to-one meeting scheduling problem with two types of actors
Complexity of a one-to-one meeting scheduling problem with two types of actors
2015
This article deals with a new scheduling problem that arises in the organization of...
A review of dynamic vehicle routing problems
A review of dynamic vehicle routing problems
2013
A number of technological advances have led to a renewed interest in dynamic vehicle...
An event‐driven optimization framework for dynamic vehicle routing
An event‐driven optimization framework for dynamic vehicle routing
2012
The real‐time operation of a fleet of vehicles introduces challenging...
A memetic algorithm for the multi‐compartment vehicle routing problem with stochastic demands
A memetic algorithm for the multi‐compartment vehicle routing problem with stochastic demands
2010
The multi‐compartment vehicle routing problem (MC‐VRP) consists of...
An Optimal Constraint Programming Approach to the Open‐Shop Problem
An Optimal Constraint Programming Approach to the Open‐Shop Problem
2012
This paper presents an optimal constraint programming approach for the...
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands
2011
The vehicle routing problem with stochastic demands (VRPSD) consists of designing...
A new lower bound for the open-shop problem
A new lower bound for the open-shop problem
1999
In this paper, we present a new lower bound for the open-shop problem. In shop...
Using intelligent backtracking to improve branch-and-bound methods: An application to open-shop problems
Using intelligent backtracking to improve branch-and-bound methods: An application to open-shop problems
2000
Only two branch-and-bound methods have been published so far for the Open-Shop...
Classical and new heuristics for the open-shop problem: A computational evaluation
Classical and new heuristics for the open-shop problem: A computational evaluation
1998
We study the problem of constructing minimum makespan schedules for the Open-Shop...
Papers per page: