Auswahl der wissenschaftlichen Literatur zum Thema „Ordonnancement coopératif“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Ordonnancement coopératif" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Dissertationen zum Thema "Ordonnancement coopératif"
Gargouri, Emna. „Ordonnancement coopératif en industrie agroalimentaire“. Lille 1, 2003. https://pepite-depot.univ-lille.fr/RESTREINT/Th_Num/2003/50376-2003-325.pdf.
Der volle Inhalt der QuelleDavid, Michaël. „Définition d'un cadre pour l'organisation et l'évaluation des activités du travail coopératif“. Nancy 1, 2004. http://docnum.univ-lorraine.fr/public/SCD_T_2004_0202_DAVID.pdf.
Der volle Inhalt der QuelleThe object of this study is the definition of a framework which assists cooperative work. The approach is composed by 4 axes which enable to define an adequate organization of the co-operative activities. Axis 1 relates to the structuring of the activities: analysis of dependences, gathering and/or decomposition in tasks, workgroups scheduling. Axis 2 relates to the characterization of the activities: definition of the roles and management of the interfaces. Axis 3 relates to the work organization evaluation: estimate of the lead times, loads and costs. Axis 4 relates to the work organization optimization: implementation of various solutions for activities organization and execution. Methods resulting from the graph theory, partitioning techniques and performance evaluation are proposed to support each axis. A software tool was developed to implement these proposals. It gives a support for the decision-making in management, the dynamic control of the cooperative processes. .
Nguyen, Hai Dang. „Déploiement et ordonnancement dans Wimax avec relais : IEEE802.16j“. Phd thesis, Université d'Evry-Val d'Essonne, 2011. http://tel.archives-ouvertes.fr/tel-00878774.
Der volle Inhalt der QuelleMouloua, Zerouk. „Ordonnancements coopératifs pour les chaînes logistiques“. Phd thesis, Institut National Polytechnique de Lorraine - INPL, 2007. http://tel.archives-ouvertes.fr/tel-00606329.
Der volle Inhalt der QuelleMouloua, Zerouk. „Ordonnancements coopératifs pour les chaînes logistiques“. Electronic Thesis or Diss., Vandoeuvre-les-Nancy, INPL, 2007. http://www.theses.fr/2007INPL090N.
Der volle Inhalt der QuelleWe propose new decision methods for coordinating supply chain scheduling. We focus on the cooperation between supply chain partners by means of negotiations about suppliers’ raw materials arrival dates, and customers’ delivery dates of finished. We consider a supply chain, which consists in a network of independant enterprises. The finished products (or sub products) of the assembly enterprise are produced using components and/or sub products supplied by other enterprises or by external suppliers. We are at the scheduling level and each enterprise builds its own schedules associated with its production centers. As an operation can be performed only when the production center has received the necessary components, the schedules are dependent. This induces negotiations between decision centers which is expressed by penalty functions associated with soft and hard release dates and due dates. A global solution is searched by an iterative decomposition approach including alternatively bilateral negotiations between the production decision centers and just in time scheduling, minimizing the local total sum of penalties. To solve each local just-in-time scheduling problem, we propose an approximation approach based on meta-heuristics, which explores the set of solutions, in which a solution is described by the job order on each machine and is evaluated using a “pert cost” algorithm.. A semi-decentralized control is suggested to assume the negotiation convergence. Furthermore, we study some transportation optimization problems in supply chains
Rammal, Darine. „Memory safety for synchronous reactive programming“. Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1002.
Der volle Inhalt der QuelleSynchronous Reactive Languages are an excellent choice for IoT programming due to their clear system-environment interaction semantics. However, when it comes to safety- critial or resource-constrained systems, recent proposals like Fairthreads or ReactiveML face a well-known issue. Fairthreads' manual memory management can lead to errors, while ReactiveML's garbage collection ensures memory safety but introduces execution overhead. This thesis aims to address the memory safety issue by developing a reactive programming language specifically designed for real-time systems, incorporating cooperative threads and synchronous execution. Drawing from the robust type system of the Rust programming language, we propose a Rust-like type system for a kernel reactive programming language named MSSL. MSSL features a cooperative threading model and facilitates mutable data sharing between threads while preserving type and borrowing safety. To achieve this, we introduce a novel abstraction called Trc (Thread Reference Counting), which combines the ownership safety of Rust references with the reference counting mechanism of Rust smart pointers. Then, we present the semantics and type system of MSSL to demonstrate its capabilities in maintaining type safety, borrowing safety, and concurrency safety. Furthermore, we extend MSSL by introducing reactive extensions, incorporating the concept of signals that offer powerful, flexible, and reliable means of communication. Finally, we provide a Java implementation of the complete MSSL set, based on the semantic and typing rules of its type system
Tranvouez, Erwan. „IAD et ordonnancement, une approche coopérative du réordonnancement par systèmes multi-agents“. Aix-Marseille 3, 2001. http://www.theses.fr/2001AIX30023.
Der volle Inhalt der QuelleDistributed Artificial Intelligence (DAI) and more particularly MultiAgent Systems (MAS) propose nowadays solutions to many industrial problems. Our research focuses more precisely on workshop scheduling facing dirupting events. We address this issue by proposing a co-operative workshop rescheduling method with a Cooperative Distributed Problem Solving (CDPS) approach. This method is based on an organisationnal modelling of a workshop granting autonomy to the workshop machines, enabling them to engage cooperation to manage a disruption the earliest as possible. To achieve this, we have elaborated a set of repair scheduling strategies and operations consisting in local and limited modification of a disruptive scheduling. To define the cooperative processes involved in the cooperative rescheduling method, we propose a workshop multiagent modelling composed of two categories of agents (scheduler and service agents). .
Haudot, Luc. „Une approche orientée utilisateur pour la conception de systèmes coopératifs en ordonnancement de production“. Toulouse, INSA, 1996. http://www.theses.fr/1996ISAT0015.
Der volle Inhalt der QuelleKacem, Imed. „Ordonnancement multicritère des job-shops flexibles : formulation, bornes inférieures et approche évolutionniste coopérative“. Lille 1, 2003. https://pepite-depot.univ-lille.fr/RESTREINT/Th_Num/2003/50376-2003-3.pdf.
Der volle Inhalt der QuelleDeux approches ont été développées dans ce modèle. La première est l'Approche par Localisation (AL). Elle permet de construire un ensemble de solutions en minimisant les critères liés à la répartition des ressources dans le cas des job-shops flexibles. La deuxième est une approche basée sur des techniques à stratégie d'évolution contrôlées pour améliorer la qualité des solutions données par l'AL. Dans ce cadre, trois nouveaux codages ont été mis en œuvre tout en développant les opérateurs génétiques associés. En outre, quelques aspects modulaires de cette méthode sont également présentés dans le troisième chapitre. Dans le cinquième chapitre, nous illustrons la mise en oeuvre des différentes approches proposées sur un jeu de données afin d'évaluer leurs performances. Nous présentons également quelques comparaisons à d'autres méthodes. De plus, nous validons la méthode proposée sur une grande série d'exemples pratiques. Enfin, nous concluons ce mémoire en rappelant les grandes lignes des travaux menés et en présentant quelques perspectives de recherche futures concernant les possibles applications réelles de l'approche développée
Autuori, Julien. „Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile“. Thesis, Troyes, 2014. http://www.theses.fr/2014TROY0036/document.
Der volle Inhalt der QuelleIn this thesis, the solution space exploration by the metaheuristic is developed. The metaheuristics optimization methods are used to solve NP-hard problems. They explore randomly the search space to look for the best solutions. In a first step, the solution set is modeled by a one-dimensional space by a Mapping Method (MaM). Metrics are proposed to evaluate the search space exploration by a metaheuristic, identifying the explored and unexplored zones. These metrics are used to guide the search space exploration of an optimization method. The convergence is improved by emphasizing the research in the zones explored. To get out local minima, the exploration is diversified by pointing it towards the unexplored zones. Combining the neighbour discovery of the solutions and these mapping metrics, it is possible to improve the performance of metaheuristics. Several single-objective and multi-objective algorithms are implemented in the classic version, hybridized with local search and MaM. The Flexible Job Shop Problem (FJSP) is used as a reference problem. The experimentations with hybridized algorithms show performance improved