Christelle Guéret - Ecole des mines de Nantes

Christelle Guéret
[email protected]
Assistant professor
Logistic and Production Systems team
École des Mines de Nantes - IRCCyN
Publications
Book chapters
[1] C. Guéret, N. Jussien, P. Boizumault, and C. Prins. Building university timetables
using Constraint Logic Programming. In Edmund Burke and Peter Ross, réds., Practice and Theory of Automated Timetabling, volume 1153 of Lecture Notes in Computer
Science, pages 130–145. Springer-Verlag, 1996.
[2] A. Elkhyari, C. Guéret, and N. Jussien. Solving dynamic resource constraint project
scheduling problems using new constraint-programming tools. Springer Lecture Notes in
Computer Science, 2740 :39–59, 2003.
[3] Abdallah Elkhyari, Christelle Guéret, and Narendra Jussien. Ordonnancement dynamique de projet à contraintes de ressources. Hermès, 2005. ISBN : 2746210282.
[4] Christelle Guéret and Narendra Jussien. Reactive Approaches. ISTE Publishing Company, 2008. ISBN : 190520972X.
[5] N. Velasco, P. Castagliola, P. Dejax, C. Guéret, and C. Prins. A memetic
algorithm for a pickup and delivery problem by helicopter, pages 173–190. Springer SCI
161Series, 2008.
Books
[6] C. Guéret, C. Prins, and M. Sevaux. Programmation linéaire - 65 problèmes d’optimisation modélisés et résolus avec Visual Xpress. Eyrolles, 2000. ISBN : 2-212-09202-4.
[7] C. Guéret, C. Prins, and M. Sevaux. Applications of optimization with Xpress-MP.
Dash Optimization, 2002. Translated and revised by S. Heipcke, ISBN : 0-9543503-0-8.
[8] Groupe GOThA. Modèles et algorithmes en Ordonnancement. Ellipses, 2004. ISBN :
2-212-09202-4.
Journal articles
[9] P. Boizumault, Y. Delon, C. Guéret, and L. Péridy. Résolution de problèmes
en programmation logique sous contraintes. RIA (Revue d’Intelligence Artificielle),
9(3) :383–406, 1995.
1
[10] C. Guéret and C. Prins. Classical and new heuristics for the open-shop problem.
EJOR (European Journal of Operational Research), 107(2) :306–314, 1998.
[11] C. Guéret and C. Prins. A new lower bound for the open-shop problem. AOR (Annals
of Operations research), 92 :165–183, 1999.
[12] C. Guéret, N. Jussien, and C. Prins. Using intelligent backtracking to improve branchand-bound methods. EJOR (European Journal of Operational Research), 127 :344–354,
2000.
[13] C. Guéret, N. Jussien, O. Lhomme, C. Pavageau, and C. Prins. Loading aircraft for
military operations. JORS (Journal of the Operational Research Society), 54 :458–465,
2003.
[14] S. Martinez, S. Dauzère-Pérès, C. Guéret, Y. Mati, and N. Sauer. Complexity
of flow-shop scheduling problems with a new blocking constraint. European Journal of
Operational Research, 169(3) :855–864, 2005.
[15] J. Mendoza, B. Castanier, C. Guéret, A. Medaglia, and N. Velasco. A memetic
algorithm for the multi-compartment vehicle routing problem with stochastic demands.
Computers and Operations Research, 37 :pp. 1886–1898, 2010.
[16] A. Malapert, H. Cambazard, C. Guéret, N. Jussien, L.M. Martin-Rousseau,
and A. Langevin. An optimal constraint programming approach to the open shop
problem. Journal on Computing, 2011. to appear.
[17] J. Mendoza, B. Castanier, C. Guéret, A. Medaglia, and N. Velasco. Constructive heuristics for the multi-compartment vehicle routing problem with stochastic demands. Transportation Science, 2011. to appear.
Conference proceedings
[18] C. Guéret, N. Jussien, P. Boizumault, and C. Prins. Building university timetables
using Constraint Logic Programming. In ICPTAT’95 : First international Conference on
the Practice and Theory of Automated Time Tabling, pages 393–408, Edinburgh, United
Kingdom, Août 1995.
[19] C. Guéret and C. Prins. Classical and new heuristics for the open-shop problem, a
computational evaluation. In PMS’96 International Workshop on Project Management
and Scheduling, Poznan, Poland, Avril 1996.
[20] C. Guéret, N. Jussien, and C. Prins. Using intelligent backtracking to improve branch
and bound methods : an application to open-shop problems. In PMS’98 International
Workshop on Project Management and Scheduling, Istanbul, Turkey, Juillet 1998.
[21] N. Jussien and C. Guéret. Procédures de séparation-évaluation – une alternative
au retour-arrière – application au problème d’open-shop. In Journées Francophones de
Progammation en Logique et avec Contraintes, pages 231–250, Nantes, France, Mai 1998.
Hermès.
[22] C. Guéret and N. Jussien. Combining AI/OR techniques for solving open-shop problems. In CPAIOR’99 Workshop on Integration of AI and OR techniques in Constraint
Programming for Combinatorial Optimization Problems, Ferrara, Italy, Février 1999.
2
[23] A. Elkhyari, C. Guéret, and N. Jussien. Conflict-based repair techniques for solving
dynamic scheduling problems. In Principles and Practice of Constraint Programming
(CP 2002), number 2470 in Lecture Notes in Computer Science, pages 702–707, Ithacca,
NY, USA, Septembre 2002. Springer-Verlag. Short paper.
[24] A. Elkhyari, C. Guéret, and N. Jussien. New tools for solving dynamic timetabling
problems. In PATAT’02 (fourth international conference on the Practice And Theory of
Automated Timetabling), Gent, Belgium, Août 2002.
[25] N. Brahimi, S. Dauzère-Pérès, and C. Guéret. Ordonnancement de tâches dans un
centre de dialyse. In GISEH03 (1re conférence francophone en Gestion et Ingénierie des
Systèmes Hospitaliers), Lyon, France, Janvier 2003.
[26] S. Martinez, S. Dauzère-Pérès, C. Guéret, Y. Mati, and N. Sauer. Complexity of
flow-shop scheduling problems with a new blocking constraint. In CESA’03 (Traitement
de l’Information dans la Théorie des Systèmes et ses Applications), Lille, France, Juillet
2003.
[27] A. Elkhyari, C. Guéret, and N. Jussien. Constraint programming for dynamic scheduling problems. In ISS’04 (International Symposium on Scheduling 2004), Yumebutai
(Japan), Mai 2004.
[28] A. Elkhyari, C. Guéret, and N. Jussien. Stable solutions for dynamic project scheduling problems. In PMS’04 (Ninth international workshop on Project Management and
Scheduling), Nancy (France), Avril 2004.
[29] S. Martinez, S. Dauzère-Pérès, C. Guéret, and N. Sauer. Modèle optimal pour le
flow-shop hybride à deux étages avec une nouvelle contrainte de blocage. In MOSIM04
(5e Conférence Francophone de MOdélisation et SIMulation), Nantes, France, Septembre
2004.
[30] S. Martinez, C. Guéret, and N. Sauer. Heuristics for the two-stages hybrid flowshop
with a new blocking constraint. In PMS’04 (Ninth international workshop on Project
Management and Scheduling), Nancy (France), Avril 2004.
[31] N. Velasco, H. Cambazard, P. Dejax, and C. Gueret. Aplicación de la técnica
de generación de columnas a la resolución de un problema de recolección y entrega con
helicóptero. In CLAIO’06, Montevideo, Uruguay, Novembre 2006.
[32] D. Daste, C. Guéret, and C. Lahlou. A branch-and-price algorithm to minimize
the maximum lateness on a batch processing machine. In PMS’08 (11th international
workshop on Project Management and Scheduling), Istanbul (Turkey), Avril 2008.
[33] D. Daste, C. Guéret, and C. Lahlou. Génération de colonnes pour l’ordonnancement
d’une machine à traitement par fournées. In MOSIM’08, Paris (France), Avril 2008.
[34] J. Mendoza, B. Castanier, C. Guéret, A. Medaglia, and N. Velasco. Construction heuristics for the multi-compartment vehicle routing problem with stochastic demands. In CLAIO’08, Cartagena (Colombia), Septembre 2008.
[35] J. Mendoza, B. Castanier, C. Guéret, A. Medaglia, and N. Velasco. A genetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. In
EU/MEeting 2008 On Metaheuristics for Logistics and Vehicle Routing, Troyes (France),
Octobre 2008.
3
[36] J. Mendoza, C. Guéret, A. Medaglia, N. Velasco, and J. Villegas. Jcw : An
object-oriented framework for the rapid development of vehicle routing heuristics based
on savings. In CLAIO’08, Cartagena (Colombia), Septembre 2008.
[37] J. Mendoza, B. Castanier, C. Guéret, A. Medaglia, and N. Velasco. A
simulation-based moea for the multi-compartment vehicle routing problem with stochastic demands. In MICŠ09 (VIII Metaheuristic International Conference), Hamburg
(Germany), Juillet 2009.
[38] A. Malapert, C. Guéret, and L.M. Rousseau. A constraint programming approach
for a batch processing problem with non-identical job sizes. In CPAIOR’11, Berlin (Germany), Mai 2011.
Conference talks
[39] P. Boizumault, C. Guéret, and N. Jussien. Efficient labeling and constraint relaxation for solving time tabling problems. In Pierre Lim and Jean Jourdan, réds., Proceedings of the 1994 ILPS post-conference workshop on Constraint Languages/Systems
and their use in Problem Modeling : Volume 1 (Applications and Modelling), Technical
Report ECRC-94-38, ECRC, Munich, Germany, Novembre 1994.
[40] P. Boizumault, C. Guéret, and N. Jussien. énumération et relaxation en programmation logique avec contraintes. In Rencontres sur la résolution pratique des problèmes
NP-complets, Montpellier, France, Septembre 1994.
[41] C. Guéret and C. Prins. A new lower bound for the open-shop problem. In MAPSP’97
Third Workshop on Models and Algorithms for Planning and Scheduling Problems, Cambridge, Royaume-Uni, Avril 1997.
[42] C. Guéret and C. Prins. Forbidden intervals for open-shop problems. In 15th triennal
conference IFORS’99, Beijing, China, Août 1999.
[43] N. Jussien and C. Guéret. Improving branch-and-bound algorithms for open-shop
problems. In 15th triennal conference IFORS’99, Beijing, China, Août 1999.
[44] C. Guéret, N. Jussien, O. Lhomme, C. Pavageau, and C. Prins. Chargement
d’avions dans le cadre de la projection de forces. In ROADEF’2000 (3ème congrès de la
société Française de Recherche Opérationnelle et d’Aide à la Décision), Nantes, France,
Janvier 2000.
[45] C. Guéret, N. Jussien, O. Lhomme, C. Pavageau, and C. Prins. Loading aircrafts
for military operations. In ODYSSEUS’2000 (First international workshop on freight
transportation and logistics), Chania, Greece, Mai 2000.
[46] C. Guéret and C. Prins. Application des problèmes d’empilement à l’ajustement de
fenêtres d’exécution dans l’open-shop. In ROADEF’2000 (3ème congrès de la société
Française de Recherche Opérationnelle et d’Aide à la Décision), Nantes, France, Janvier
2000.
[47] S. Dauzère-Pérès, C. Guéret, and M. Galvis. A column generation approach for a
two-stage hybrid flow-shop problem. In ROADEF’02, Paris, France, Février 2002.
[48] A. Elkhyari, C. Guéret, and N. Jussien. Explanation-based repair techniques for
solving dynamic scheduling problems. In AIPS’02 Workshop on On-line Planning and
Scheduling, Toulouse, France, Avril 2002.
4
[49] S. Dauzère-Pérès, C. Guéret, S. Martinez, Y. Mati, and N. Sauer. Complexité des
problèmes d’ordonnancement de type flow-shop avec de nouvelles contraintes de blocage.
In ROADEF’03, Avignon, France, Février 2003.
[50] A. Elkhyari, C. Guéret, and N. Jussien. Programmation par contraintes étendue
pour résoudre le RCPSP dynamique et quelques extensions. In ROADEF’03, Avignon,
France, Février 2003.
[51] A. Elkhyari, C. Guéret, and N. Jussien. Solving dynamic RCPSP using explanationbased constraint programming. In MAPSP’03 (Sixth Workshop on Models and Algorithms
for Planning and Scheduling Problems), Aussois, France, Mars 2003.
[52] S. Martinez, C. Guéret, and N. Sauer. A simulated annealing method for the flowshop with a new blocking constraint. In EUROXX (20th European conference on Operational Research), Rhodes (Greece), Juillet 2004.
[53] N. Velasco, P. Dejax, and C. Guéret. Vehicle routing optimization for the pick-up
and delivery : Application to the transport of personnel on oil platforms. In EUROXX
(20th European conference on Operational Research), Rhodes (Greece), Juillet 2004.
[54] C. Prud’homme, P. Dejax, C. Guéret, and N. Velasco. Heuristique pour un problème de tournées d’hélicoptère de type pickup and delivery. In ROAdEF’05, Tours
(France), Février 2005.
[55] N. Velasco, P. Dejax, and C. Guéret. Une approche par génération de colonnes pour
un problème de tournées d’hélicoptère. In ROAdEF’05, Tours (France), Février 2005.
[56] N. Velasco, P. Dejax, C. Guéret, and C. Prins. A memetic algorithm for a pick-up
and delivery problem by helicopter. In MIC’05, Vienna (Austria), Août 2005.
[57] N. Velasco, P. Dejax, C. Guéret, and C. Prins. Un algorithme génétique pour un
problème de pick-up and delivery bi-objectif. In MOSIM’06, Rabah (Maroc), Avril 2006.
[58] A. Malapert, C. Gueret, N. Jussien, A. Langevin, and L-M. Rousseau. A
constraint programming approach to integrated routing and packing problems. In
SCRO/Journées de l’Optimisation 2008, Montréal (Canada), Mai 2008.
[59] Arnaud Malapert, Christelle Guéret, Narendra Jussien, André Langevin, and
Louis-Martin Rousseau. Two-dimensional pickup and delivery routing problem with loading constraints. In First CPAIOR Workshop on Bin Packing and Placement Constraints
(BPPC’08), Paris, France, Mai 2008.
[60] C. Guéret, O. Morineau, C. Pavageau, O. Péton, and D. Poncelet. Optimisation
de la planification de bourses d’échanges de technologies. In ROADEF, Nancy (France),
Février 2009.
[61] E.V. Gutierrez, C.A. Amaya, C. Guéret, O. Péton, and N. Velasco. Combined
routing and staff scheduling model for home health care. In ORAHSŠ09 (35th International Conference on Operational Research Applied to Health Services), Leuven (Belgium),
Juillet 2009.
[62] M. Maiza, C. Guéret, P. Lemaire, and M.S. Radjef. An iterative lower bound for bin
packing problems with conflicts. In EUROŠ09 (23rd European Conference on Operational
Research), Bonn (Germany), Juillet 2009.
[63] D. Lemoine, O. Bellenguez-Morineau, C. Guéret, and N. Najid. Résolution
d’un problème réel de type job-shop flexible multi-ressources. In ROADEF’10, Toulouse
(France), Février 2010.
5
[64] A. Malapert, C. Guéret, N. Jussien, A. Langevin, and L-M. Rousseau. A decomposition approach to the batch processing problem. In JOPT’10, Montréal (Canada),
Juin 2010.
[65] J. Mendoza, B. Castanier, C. Guéret, A. Medaglia, and N. Velasco. Constructive heuristics for the multi-compartment vehicle routing problem with sthocastic demands. In ALIO/INFORMS’10, Buenos Aires (Argentina), Juin 2010.
[66] V. Pillac, C. Guéret, and A. Medaglia. Solving the vehicle routing problem with
stochastic demands with a multiple scenario approach. In ALIO/INFORMS’10, Buenos
Aires (Argentina), Juin 2010.
Research reports
[67] C. Guéret, N. Jussien, and C. Prins. Using intelligent backtracking to improve branchand-bound methods : an application to open-shop problems. Rapport de recherche, École
des Mines de Nantes, Octobre 1998. 98/8/AUTO.
[68] C. Guéret and C. Prins. Efficient heuristic black boxes for the open-shop : Comparison
with other methods on three benchmarks. Rapport de recherche, École des Mines de
Nantes, 1998. 98/11/AUTO.
[69] C. Guéret and C. Prins. Forbidden intervals for open-shop problems. Rapport de
recherche, École des Mines de Nantes, Octobre 1998. 98/10/AUTO.
[70] C. Guéret, N. Jussien, O. Lhomme, C. Pavageau, and C. Prins. Loading aircrafts
for military operations. Rapport de recherche, École des Mines de Nantes, Février 2001.
01/2/INFO.
[71] A. Elkhyari, C. Guéret, and N. Jussien. Conflict-based repair techniques for solving
dynamic scheduling problems. 5. Rapports de recherche 02/3/AUTO, École des Mines
de Nantes, Mai 2002. also available as 02/5/INFO.
[72] S. Martinez, S. Dauzère-Pérès, C. Guéret, Y. Mati, and N. Sauer. Complexity of
flowshop scheduling problems with a new blocking constraint. 5. Rapports de recherche
03/11/AUTO, École des Mines de Nantes, Mai 2003. also available as 02/5/INFO.
[73] C. Prud’homme, P. Dejax, C. Guéret, and N. Velasco. Heuristiques pour un
problème de tournées d’hélicoptères de type pick-up and delivery. Rapport de recherche,
École des Mines de Nantes, 2004. 04/5/AUTO.
[74] C. Prud’homme, P. Dejax, C. Guéret, and N. Velasco. Heuristiques pour un problème de tournées d’hélicoptères de type pick-up and delivery. 5. Rapports de recherche
04/5/AUTO, Ecole des Mines de Nantes, 2005.
[75] N. Velasco, P. Dejax, C. Guéret, and C. Prins. A memetic algorithm for a pickup
and delivery problem by helicopter. 5. Rapports de recherche 05/9/AUTO, Ecole des
Mines de Nantes, 2005.
[76] N. Velasco, P. Dejax, C. Guéret, and C. Prins. A non dominated sorting algorithm
for a bi-objective pickup and delivery problem. 5. Rapports de recherche 05/10/AUTO,
École des Mines de Nantes, 2005.
[77] Arnaud Malapert, Christelle Guéret, Narendra Jussien, André Langevin, and
Louis-Martin Rousseau. Two-dimensional pickup and delivery routing problem with
6
loading constraints. Research Report CIRRELT-2008-37, Centre Interuniversitaire de
Recherche sur les Réseaux d’Entreprise, la Logistique et le Transport (CIRRELT), Montréal, Canada, 2008.
[78] Jorge E. Mendoza, Bruno Castanier, Christelle Guéret, Andrés L. Medaglia, and
Nubia M. Velasco. Calculating the expected cost of recourse in a multi-compartment
vehicle routing problem with stochastic demands. 5. Rapports de recherche 08/3/AUTO,
École des Mines de Nantes, 2008.
[79] Jorge E. Mendoza, Bruno Castanier, Christelle Guéret, Andrés L. Medaglia, and
Nubia M. Velasco. An instance generator for vehicle routing problems with stochastic
demands. 5. Rapports de recherche 08/1/AUTO, École des Mines de Nantes, 2008.
[80] Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, and Louis-Martin Rousseau. An optimal constraint programming approach to the open-shop problem. Research Report CIRRELT-2009-25, Centre Interuniversitaire de Recherche sur les Réseaux d’Entreprise, la Logistique et le Transport
(CIRRELT), Montréal, Canada, 2009.
[81] V. Pillac, C. Guéret, and A. Medaglia. Dynamic vehicle routing problems : State
of the art and prospects. 5. Rapports de recherche 10/4/AUTO, École des Mines de
Nantes, 2010.
Patent
[82] D. Daste, C. Guéret, and P. Lemaire. Procédé d’optimisation d’ordonnancement
de traitement de taches et procédé de fabrication de pièces en matériau composite comprenant un tel ordonnancement. National number : FR2932587 (2009), international
number : EP2304659 (2011).
Miscellaneous
[83] N. Brahimi and C. Guéret. Optimisation de la logistique hospitalière : service blanchisserie. Techniques de l’Ingénieur, 2007. IN68.
[84] bureau de la ROADEF. Quand les industriels lancent des défis aux laboratoires. Techniques de l’Ingénieur, (47), 2007. Instantanés techniques.
7