Filtrer vos résultats
- 63
- 49
- 76
- 26
- 6
- 2
- 1
- 1
- 112
- 1
- 1
- 4
- 5
- 5
- 7
- 10
- 16
- 13
- 5
- 11
- 4
- 5
- 8
- 5
- 8
- 2
- 1
- 1
- 1
- 80
- 32
- 112
- 51
- 15
- 11
- 8
- 7
- 6
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 112
- 15
- 15
- 14
- 14
- 14
- 13
- 12
- 11
- 11
- 8
- 8
- 8
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
112 résultats
Sensitivity analysis for one and m machinesJ-C Billaut and A Moukrim and E Sanlaville. Flexibility and Robustness in Scheduling, ISTE-Wiley publishing, London, pp.73-97, 2008, 9780470611432. ⟨10.1002/9780470611432.ch4⟩
Chapitre d'ouvrage
hal-00445448v1
|
|||
Scheduling Problems with Production and Consumption of ResourcesNinth International Colloquium on Graphs and Optimization, Jul 2014, Sirmione, Italy
Communication dans un congrès
hal-01062593v1
|
|||
Lower Bounds for the Two-Machine Flow Shop Problem with Time DelaysAndreas Fink ; Armin Fügenschuh ; Martin Josef Geiger Operations Research Proceedings 2016, Springer International Publishing, pp.527-533, 2017, 978-3-319-55702-1. ⟨10.1007/978-3-319-55702-1_70⟩
Chapitre d'ouvrage
hal-01551051v1
|
|||
A Hybrid Heuristic for the Synchronized Team Orienteering Problem with Time WindowsInternational Workshop on Stochastic Local Search Algorithms (SLS2019), Sep 2019, Lille, France
Communication dans un congrès
hal-02418540v1
|
|||
|
|
A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solutionEngineering Applications of Artificial Intelligence, 2017, 66, pp.75-86. ⟨10.1016/j.engappai.2017.08.017⟩
Article dans une revue
hal-01698361v1
|
||
|
|
Tabu Search to Plan Schedules in a Multiskill Customer Contact CenterICSSSM'06, Oct 2006, France. pp.1126-1131
Communication dans un congrès
hal-00783884v1
|
||
Combinatorial auction for LTL transportation service procurement with clusters of requests20e congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2019), Feb 2019, Le Havre, France
Communication dans un congrès
hal-02491729v1
|
|||
|
|
Solving a Permutation Flow Shop Problem with Blocking and Transportation DelaysProject Management and Scheduling (PMS 2008), Apr 2008, Istanbul, Turkey
Communication dans un congrès
hal-00452689v1
|
||
A new LP-Based lower bound for the Event Scheduling Problem with Consumption and Production of Resources15th International Conference on Project Management and Scheduling (PMS 2016), Apr 2016, Valencia, Spain. pp.158-161
Communication dans un congrès
hal-01321574v1
|
|||
An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order EnumerationEuropean Journal of Operational Research, 2015, 244 (2), pp.360-368. ⟨10.1016/j.ejor.2014.12.037⟩
Article dans une revue
hal-01306519v1
|
|||
|
|
Optimisation par essaim particulaire pour résoudre le problème de m-tournées sélectivesROADEF 2011, Mar 2011, Saint-Etienne, France
Communication dans un congrès
hal-00576532v1
|
||
|
|
GRASP-ELS pour la résolution du problème de tournées de véhicules avec profits et contraintes de capacitéROADEF, Université de Technologie de Compiègne, Feb 2016, COMPIEGNE, France
Communication dans un congrès
hal-01261468v1
|
||
|
|
Méthodes exacte et approchée pour le problème de flow shop avec robot11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF), Feb 2010, Toulouse, France
Communication dans un congrès
hal-00460781v1
|
||
Staff scheduling in airport security serviceINCOM'12, 2012, Bucarest,Romania, Romania. pp.61-72
Communication dans un congrès
hal-00999257v1
|
|||
A Memetic Algorithm for staff scheduling problem in airport security serviceExpert Systems with Applications, 2013, 40 (18), pp.7504-7512. ⟨10.1016/j.eswa.2013.06.073⟩
Article dans une revue
hal-00999215v1
|
|||
|
|
A polynomial algorithm for recognizing the Am order classDiscrete Mathematics, 2009, 309, pp.4200-4204. ⟨10.1016/j.disc.2008.10.032⟩
Article dans une revue
hal-00445451v1
|
||
Simultaneously Handling Routing and Scheduling Through a GRASPxELS Algorithm27th European Conference on Operational Research (EURO), Jul 2015, Glasgow, United Kingdom
Communication dans un congrès
hal-01319762v1
|
|||
|
|
An exact method for graph coloringComputers and Operations Research, 2006, 33 (8), pp.2189-2207. ⟨10.1016/j.cor.2005.01.008⟩
Article dans une revue
hal-00783637v1
|
||
|
|
Heuristic Solutions for the Vehicle Routing Problem with Time Windows and Synchronized VisitsOptimization Letters, 2016, 10 (3), pp.511-525. ⟨10.1007/s11590-015-0878-3⟩
Article dans une revue
hal-01131888v1
|
||
|
|
A matheuristic for exam timetablingFAC Conference on Manufacturing Modelling, Management and Control , Université de Technologie de Troyes, Jun 2016, Troyes, France. pp.1289-1294, ⟨10.1016/j.ifacol.2016.07.701⟩
Communication dans un congrès
hal-01397216v1
|
||
|
|
Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windowsComputers and Operations Research, 2020, 123, pp.105039. ⟨10.1016/j.cor.2020.105039⟩
Article dans une revue
hal-02890475v1
|
||
Flexibilité et Robustesse en OrdonnancementBulletin de la ROADEF, 2002, 8, 3 p
Article dans une revue
inria-00100949v1
|
|||
Du générique au spécifique : Problèmes d’ordonnancement avec production et consommation des ressourcesROADEF, Heudiasyc - Universitée de Technologie de Compiègne, Feb 2016, Compiegne, France
Communication dans un congrès
hal-01301181v1
|
|||
Improving Lower Bounds for a Two-Dimensional Bin-Packing Problem by Generating New Data-Dependent Dual-Feasible FunctionsInternational Journal of Production Research, 2009, 47 (2), pp.537-560
Article dans une revue
inria-00522677v1
|
|||
Comparison of mixed integer linear programming models for the Event Scheduling Problem with Consumption and Production of Resources8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM 2016), Jun 2016, Troyes, France. pp.1044-1049
Communication dans un congrès
hal-01321579v1
|
|||
Introduction to Flexibility and Robustness in SchedulingJ-C Billaut and A Moukrim and E Sanlaville. Flexibility and Robustness in Scheduling, 1, ISTE-Wiley publishing, London, pp.15-33, 2008, 9780470611432. ⟨10.1002/9780470611432.ch1⟩
Chapitre d'ouvrage
hal-00445444v1
|
|||
|
|
An adaptive heuristic for the Capacitated Team Orienteering Problem8th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2016, Jun 2016, Troyes, France. pp.1662 - 1666
Communication dans un congrès
hal-01379605v1
|
||
Preprocessing and an improved MIP model for examination timetablingAnnals of Operations Research, 2015, 229 (1), pp.19-40. ⟨10.1007/s10479-015-1832-6⟩
Article dans une revue
hal-01130350v1
|
|||
Exam timetabling at Université de Technologie de Compiègne: a memetic approachThe 10th International Conference of the Practice and Theory of Automated Timetabling, Aug 2014, York, United Kingdom. pp.438-441
Communication dans un congrès
hal-01059931v1
|
|||
|
|
Memetic algorithm with an effi cient split procedure for the Team Orienteering Problem with Time WindowsArtificial Evolution 2013, Oct 2013, france, France. pp.6-17
Communication dans un congrès
hal-00917431v1
|