Littérature scientifique sur le sujet « Ordonnancement d’atelier de type job shop »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Ordonnancement d’atelier de type job shop ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Thèses sur le sujet "Ordonnancement d’atelier de type job shop"
Tsogbetse, Israël. « Etude de codages et voisinages d'un espace de recherche. Application à l'ordonnancement de tâches dans des cas contraints ». Electronic Thesis or Diss., Bourgogne Franche-Comté, 2024. http://www.theses.fr/2024UBFCA001.
Texte intégralMetaheuristics are optimization problem-solving methods that primarily rely on an abstract representation of solutions in the form of direct or indirect encoding. Improving a solution or a set of solutions in parallel is achieved through manipulations of these encodings and algorithms evaluating the quality of associated solutions. The transition from one solution to another involves the use of one or more operators to explore the search space. Generally, metaheuristics utilize these operators to iteratively enhance solutions until reaching a local (or global) optimum. A plethora of metaheuristics has been proposed to address combinatorial optimization problems, including task scheduling problems. These ones are often dedicated to specific classes of instances. In this context, researchers frequently propose algorithms that combine various methods, striving to optimize parameters across different parts of their algorithms. However, the achieved performance is often comparable, and efficiency depends on the class of instances addressed. While solution encodings and neighborhood operators are recognized as essential components within metaheuristics, they are rarely jointly examined in an analytical and scientific manner.This thesis aims to characterize solution encodings and neighborhood operators commonly used in scheduling, particularly for the job shop problem and for one of its variants, in which the objective is to minimize the makespan. The ambition is to exploit the properties of the search spaces induced by these encodings and operators to enhance the design of metaheuristics. The approach applied in our study is structured into two main parts, with a gradation in the complexity of the job shop problem. The first part focuses on characterizing search spaces through a fitness landscape analysis, using metrics from the literature. The second part involves evaluating the performance of various combinations of encodings and neighborhood operators with the aim of identifying potential correlations with landscape properties. This is done to provide recommendations for the design of metaheuristics. This approach is initially applied to a basic job shop and then to a more constrained variant: the flexible job shop with transportation constraints. Our work highlights the challenge of linking the performance of tested combinations with standard metrics. The comparison of results obtained for the basic problem and its more constrained variant leads us to express reservations about a systematic generalization of encoding and operator characteristics for this category of optimization problems
Vilcot, Geoffrey. « Algorithmes approchés pour des problèmes d'ordonnancement multicritères de type job shop flexible et job shop multiressource ». Phd thesis, Université François Rabelais - Tours, 2007. http://tel.archives-ouvertes.fr/tel-00198068.
Texte intégralBenbrahim, Mohammed. « Ordonnancement de la production dans un atelier du type "job shop" ». Doctoral thesis, Universite Libre de Bruxelles, 1998. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212055.
Texte intégralHentous, Hamid. « Contribution au pilotage des systèmes de production de type Job Shop ». Lyon, INSA, 1999. http://www.theses.fr/1999ISAL0028.
Texte intégralTitled Contribution to Production Control in Job Shop Environment, this thesis deals with scheduling problems in job shop and hybrid job shop environments. Job shop problems are known to belong to the NP-Hard class of combinatorial problems. In order to tackle progressively the problem complexity, a first heuristic is given in order to solve the three machines job shop problem. Than this method is generalised in order to solve the scheduling machines problem in hybrid job shop environment. Our method is based on two main phases. The first phase is a changing procedure which consists to reduce the job shop problem to a flow shop one with two machines. The second phase enables us various versions of the heuristic to solve the original problem, thanks to priority rules. The latter phase consists on solving two problems: the sequencing and the assignment problems. Buffer storage constraints and limited auxiliary resources have been modeled and integrated in scheduling planning calculation. Experiments and comparisons have been done on a large number of problem data. Various production objectives have been taken into account for make to stock production and for make to order production environments. New lower bounds for optimal solution have been defined to facilitate the method evaluation. These works have been done in the context of a more global project which consists in designing a workshop control case for production systems which has been initiated in a European project Tournesol
Lamoudan, Tarik. « Algorithmes métaheuristiques pour l'ordonnancement des systèmes de production de type job shop et flow shop ». Le Havre, 2011. http://www.theses.fr/2011LEHA0009.
Texte intégralThe thesis concerns two scheduling problems, job shop scheduling and flow scheduling problem. Our contribution focuses on taking account transportation constraints of tasks between machines using a finite number of vehicles. For both problems we have given a new mathematical formulation that includes additional constraints about transportation time and different characteristics of resources (capacity, number, time availability, etc. ). We also give a new resolution algorithm based on ant colonies
El, Khoukhi Fatima. « Métaheuristiques hybrides pour la résolution de problèmes d'ordonnancement de type Job Shop ». Le Havre, 2009. http://www.theses.fr/2009LEHA0023.
Texte intégralIn most real shop floor, improving the coordination and the planning of the production with respect to the logistic activities, namely resources : machines and material handling equipments, became a great necessity for the lowering of costs and reducing of lead-times delivery. The present thesis is split into four parts. The first one is a survey of the scheduling problems ; the emphasis is on the Job Shop environments. In the second part, we provide a more detailed study of these environments : problematic, state of the art, modelling and methods of resolution. As part of the internal logistics of the production facilities in Job Shop Scheduling Problem, the third part is devoted to showing two problems, the Job Shop Scheduling Problem with transportationfor just-in-time production as well as the flexible Job Shop Scheduling problem with machines availability constraints. Finally, the last part addresses the aircraft landing problem that we formulated as a Job Shop problem. In the various study cases previously cited, our work revolves around a systematic study based on three fundamental processes, a mathematical and/or graphical formulations, and then an approach for resolution optimization based on hybrid metaheuristics, finally a validation of the results by numerical simulations. The objective is to develop dynamic scheduling systems to resolve these NP-hard problems
Vacher, Jean-Philippe. « Un système adaptatif par agents avec utilisation des algoritmes génétiques : application à l'ordonnancement d'atelier de type job-shop nm ». Le Havre, 2000. http://www.theses.fr/2000LEHA0005.
Texte intégralHammadi, Slim. « Une méthode d'ordonnancement minimisant les temps d'attente et de transit dans les systèmes de production flexibles de type job-shop ». Lille 1, 1991. http://www.theses.fr/1991LIL10141.
Texte intégral