Skip to Main content Skip to Navigation

Le problème de jobshop avec contraintes: modélisation et optimisation

Abstract : Optimization algorithms the most efficient for solving the problem of JobShop use specific methods and tools as the disjunctive graph model and neighborhoods based on this graph. To use these methods on real problems, we have the problem of enriching the JobShop. We are interested in conditions and with time lags and JobShop JobShop with transportation. For each of these two problems, the disjunctive graph model and its neighborhoods have been modified and adapted. For the problem with time lags JobShop, we proposed heuristics and metaheuristics performance, the main difficulty is to propose a solution that respects all the constraints of maximum time lags. For the problem with JobShop transport, we proposed a linear model and a metaheuristic that treat all the same problem (ie taking into account strictly into account the same constraints). In both cases, modeling a form of disjunctive graph neighborhoods and adaptation have been proposed. In addition, implementation of metaheuristic for each problem we showed that much of the development is redundant. We proposed an object-oriented software framework for optimization (BCOO) whose objective is to factor much code as possible
Mots-clés : modèle optimisation
Complete list of metadatas
Contributor : Camille Meyer <>
Submitted on : Monday, July 2, 2012 - 10:59:10 AM
Last modification on : Monday, January 20, 2020 - 12:12:05 PM
Long-term archiving on: : Thursday, December 15, 2016 - 8:06:38 PM


  • HAL Id : tel-00713587, version 1


Anthony Caumond. Le problème de jobshop avec contraintes: modélisation et optimisation. Algorithme et structure de données [cs.DS]. Université Blaise Pascal - Clermont-Ferrand II, 2006. Français. ⟨NNT : 2006CLF21723⟩. ⟨tel-00713587⟩



Record views


Files downloads