Skip to Main content Skip to Navigation

Résolution conjointe de problèmes d'ordonnancement et de routage

Abstract : This dissertation focuses on modelling and resolution of integrated scheduling and routing problems. Efficient resolutions of these problems required a proper coordination of activities/production operation, defined by starting and finishing times, and of transport operations, fully defined by starting times, finishing times and quantities of resources transferred.The resolution of this problem is based on several metaheuristics, with the aim to obtain high quality solutions in acceptable computational time. Three problems are iteratively studied considering: 1) a single machine scheduling problem and a transportation problem with a single vehicle; 2) a single machine scheduling problem with a homogeneous fleet of vehicles for the transport; 3) a RCPSP where the flow transferred between activities is transported by a heterogeneous fleet of vehicles.The first problem addressed is the PTSP (Production and Transportation Scheduling Problem - PTSP) where the routing part is devoted to a single vehicle (Geismar et al., 2008). The chapter 2 focuses on a GRASP×ELS method benchmarked with the best published methods. This method is extended to the PTSP with multiple vehicles in the chapter 3, and the method shows its capacity to address a wide range of problem, since the PTSP with a single vehicle is a special case. The second problem deals with the RCPSP, where a heterogeneous fleet of vehicles is devoted to the transportation of resources, between activities. The objective consists in considering a flow (activity exchanges solved at a strategic level), to compute a transportation plan. The main difficulties consists in using the flow to compute transport batches. A heuristic-based approach is introduced in the chapter 4 and an exact method is provided in the chapter 5.
Document type :
Complete list of metadatas
Contributor : Abes Star :  Contact
Submitted on : Tuesday, March 13, 2018 - 1:06:07 PM
Last modification on : Wednesday, March 4, 2020 - 12:28:03 PM
Long-term archiving on: : Thursday, June 14, 2018 - 2:10:38 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01730549, version 1


Marina Vinot. Résolution conjointe de problèmes d'ordonnancement et de routage. Ordinateur et société [cs.CY]. Université Clermont Auvergne, 2017. Français. ⟨NNT : 2017CLFAC043⟩. ⟨tel-01730549⟩



Record views


Files downloads