Literatura académica sobre el tema "Contraintes de blocage mixtes"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Índice
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Contraintes de blocage mixtes".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Contraintes de blocage mixtes"
Turcotte, Emmanuelle. "Les méthodes mixtes dans la recherche féministe : enjeux, contraintes et potentialités politiques". Articles 29, n.º 1 (10 de junio de 2016): 111–28. http://dx.doi.org/10.7202/1036672ar.
Texto completoROUX, M., A. L. TRIDON y A. TRIDON. "Systèmes de production mixtes lait-viande. Exemple de la région de Neufchâteau, Vosges". INRAE Productions Animales 1, n.º 4 (11 de octubre de 1988): 235–43. http://dx.doi.org/10.20870/productions-animales.1988.1.4.4457.
Texto completoVassiliadou, Hélène. "J’avoue et c’est le cas de le dire". Dire et ses marqueurs 46, n.º 2 (31 de diciembre de 2023): 296–315. http://dx.doi.org/10.1075/li.00096.vas.
Texto completoAbdelnour, Sarah y Sophie Bernard. "Faire grève hors du salariat et à distance ?" Mouvements 103, n.º 3 (24 de septiembre de 2020): 50–61. http://dx.doi.org/10.3917/mouv.103.0050.
Texto completoPetit, Pascal. "Les politiques de plein emploi appartiennent-elles au passé?" Cahiers de recherche sociologique, n.º 17 (19 de abril de 2011): 81–106. http://dx.doi.org/10.7202/1002146ar.
Texto completoSanial, Elsa. "L’appropriation de l’arbre, un nouveau front pour la cacaoculture ivoirienne ? Contraintes techniques, environnementales et foncières". Cahiers Agricultures 27, n.º 5 (septiembre de 2018): 55005. http://dx.doi.org/10.1051/cagri/2018036.
Texto completoMathieu, Catherine y Olivier Passet. "Disparités de croissance et de politiques économiques en Europe". Revue de l'OFCE 64, n.º 1 (1 de enero de 1998): 157–76. http://dx.doi.org/10.3917/reof.p1998.64n1.0157.
Texto completoAli, L., Peter Van Den Bossche y Eric Thys. "Enjeux et contraintes de l’élevage urbain et périurbain des petits ruminants à Maradi au Niger : quel avenir ?" Revue d’élevage et de médecine vétérinaire des pays tropicaux 56, n.º 1-2 (1 de enero de 2003): 73. http://dx.doi.org/10.19182/remvt.9879.
Texto completoDUCROT, C., D. FRIC, A. C. LALMANACH, V. MONNET, P. SANDERS y C. SCHOULER. "Perspectives d’alternatives thérapeutiques antimicrobiennes aux antibiotiques en élevage". INRA Productions Animales 30, n.º 1 (14 de junio de 2018): 77–88. http://dx.doi.org/10.20870/productions-animales.2017.30.1.2234.
Texto completoTAKROUR, Hassan. "Le mélange de langues au Maroc : L’arabe marocain au contact du français, le conflit d’ordre". Revue plurilingue : Études des Langues, Littératures et Cultures 4, n.º 1 (19 de noviembre de 2020): 32–50. http://dx.doi.org/10.46325/ellic.v4i1.49.
Texto completoTesis sobre el tema "Contraintes de blocage mixtes"
Tighazoui, Ayoub. "Ré-ordonnancement des systèmes de production flexibles avec contraintes de blocage mixtes soumis à des aléas de commandes ou de production". Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0187.
Texto completoToday’s digital transformation has definitely changed the customers practices. In fact, through the new information and communication tools, a customer can at any time create, modify, or cancel an order. These unexpected events have a direct impact on the work organization of the production unit, generating a disruption of the already established schedule. Therefore, a rescheduling process is necessary for efficiently revising the existing schedule, preferably with less movements. In this Ph.D, mathematical models and optimization methods are developed for rescheduling problems, under different types of disruptions, in several machine environments. The performance of the obtained solutions is measured with a new criterion, simultaneously combining the schedule efficiency and stability.The predictive-reactive scheduling strategy has been adopted in this work. It consists, in the predictive phase, to solve a classical scheduling problem minimizing the Total Weighted Waiting Time (TWWT) of the jobs, regarded as the schedule efficiency criterion. After the disruption appearance, the reactive phase starts. It consists in updating the initial problem by modifying its data, then solving the new rescheduling problem with the objective of minimizing the TWWT combined with a stability criterion. The schedule stability is measured with the Total Weighted Completion Time Deviation (TWCTD). This association of criteria is significant, and it can be very helpful in industrial applications, where the job waiting time estimates the duration that the job has waited in front of a workstation. The stability criterion is then used for limiting the deviation from the already established schedule, since this matter generates supplementary costs.This approach has been applied for different machine environments. Firstly, on a single machine, illustrating the case of a single workstation. Secondly, on parallel machines, describing the case of identical workstations. Finally, on a flowshop system where a set of jobs are treated in the same order by a set of machines. The flowshop rescheduling problem is also considered with mixed blocking constraints.These rescheduling problems have firstly been modeled as Mixed Integer Linear Programing (MILP) models. Due to their NP-hard complexity, the resolution is only possible for a limited number of jobs. Thus, heuristic methods have been designed, exploring more jobs in a reasonable time. The proposed methods have been discussed and analyzed, both in terms of solution quality and computing time
Martinez, de La Piedra Sergio. "Ordonnancement de systèmes de production avec contraintes de blocage". Nantes, 2005. http://www.theses.fr/2005NANT2004.
Texto completoThe research presented in this thesis focuses on Flow-Shop and two stages Hybrid Flow-Shop scheduling problems without storage capacity and with a new blocking constraint encountered in many industrial processes. At the beginning, this new blocking constraint is presented as well as some of its industrial applications. Next, the scheduling of these two production systems is examined. For each of them, complexity results as well as exact and heuristic resolution methods are presented. These methods are based on the mathematical modeling of the problem as well as on the modification of two well known heuristic algorithms, developed respectively for the Flow-Shop and hybrid Flow-Shop classics. The results of the heuristic are then improved by the application of a simulated annealing method where a research of the best neighborhood is made. The achieved experimentation results show the efficiency of the different proposed algorithms
Trabelsi, Wajdi. "Ordonnancement des systèmes de production flexibles soumis à différents types de contraintes de blocage". Thesis, Université de Lorraine, 2012. http://www.theses.fr/2012LORR0286/document.
Texto completoThis thesis deals mainly with makespan minimization in Flow-Shop and hybrid Flow-Shop scheduling problems where mixed blocking constraints are considered. In Flow-Shop scheduling problem, a set of N jobs must be executed on a set of M machines. All jobs require the same operation order that must be executed according to the same manufacturing process. Each machine can only execute one job at any time. Pre-emptive operation is not authorized in presented work. In case of hybrid Flow-Shop, at any processing stage k, there exist one or more identical machines Mk. Objective function consists in determining best schedule in order to reduce makespan, i.e. time where all operations are completed. The most common scheduling problem is classical flowshop where buffer space capacity between machines is considered as unlimited. Other problems are characterized by the fact that the storage capacity is limited or null and which generates one blocking constraint. This constraint can be a classical blocking (RSb) or particular blocking (RCb or RCb*). In our works, we present a general case which can be derived from industry and modeled as Flow-Shop and hybrid Flow-Shop systems subject simultaneously to different blocking. To solve these problems, we studied in this thesis complexity of these systems and we proposed exact methods, approached methods and lower bounds
Trabelsi, Wajdi. "Ordonnancement des systèmes de production flexibles soumis à différents types de contraintes de blocage". Electronic Thesis or Diss., Université de Lorraine, 2012. http://www.theses.fr/2012LORR0286.
Texto completoThis thesis deals mainly with makespan minimization in Flow-Shop and hybrid Flow-Shop scheduling problems where mixed blocking constraints are considered. In Flow-Shop scheduling problem, a set of N jobs must be executed on a set of M machines. All jobs require the same operation order that must be executed according to the same manufacturing process. Each machine can only execute one job at any time. Pre-emptive operation is not authorized in presented work. In case of hybrid Flow-Shop, at any processing stage k, there exist one or more identical machines Mk. Objective function consists in determining best schedule in order to reduce makespan, i.e. time where all operations are completed. The most common scheduling problem is classical flowshop where buffer space capacity between machines is considered as unlimited. Other problems are characterized by the fact that the storage capacity is limited or null and which generates one blocking constraint. This constraint can be a classical blocking (RSb) or particular blocking (RCb or RCb*). In our works, we present a general case which can be derived from industry and modeled as Flow-Shop and hybrid Flow-Shop systems subject simultaneously to different blocking. To solve these problems, we studied in this thesis complexity of these systems and we proposed exact methods, approached methods and lower bounds
Berger, Nicolas. "Modélisation et résolution en programmation par contraintes de problèmes mixtes continu/discret de satisfaction de contraintes et d'optimisation". Phd thesis, Université de Nantes, 2010. http://tel.archives-ouvertes.fr/tel-00560963.
Texto completoFuseau, Christelle. "Caractérisation thermomécanique des assemblages mixtes métal/composite et métal/polymère". Poitiers, 1998. http://www.theses.fr/1998POIT2329.
Texto completoAl, Kharboutly Mira. "Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C". Thesis, Normandie, 2018. http://www.theses.fr/2018NORMLH06/document.
Texto completoOur objective in this work is to solve a binary quadratic problem under mixed constraints by the techniques of DC optimization. As DC optimization has proved its efficiency to solve large-scale problems in different domains, we decided to apply this optimization approach to solve this problem. The most important part of D.C. optimization is the choice of an adequate decomposition that facilitates determination and speeds convergence of two constructed suites where the first converges to the optimal solution of the primal problem and the second converges to the optimal solution of the dual problem. In this work, we propose two efficient decompositions and simple to manipulate. The application of the DC Algorithm (DCA) leads us to solve at each iteration a convex quadratic problem with mixed, linear and quadratic constraints. For it, we must find an efficient and fast method to solve this last problem at each iteration. To do this, we apply three different methods: the Newton method, the semidefinite programing and interior point method. We present the comparative numerical results on the same benchmarks of these three approaches to justify our choice of the fastest method to effectively solve this problem
Ate, Alain Martial. "Eléments finis mixtes tridimensionnels pour le calcul des champs de contraintes dans les structures hétérogenes". Dijon, 1998. http://www.theses.fr/1998DIJOS061.
Texto completoRousseau, Louis-Martin. "Gestion de flotte avec fenêtres horaires approches de résolution mixtes utilisant la programmation par contraintes /". [Montréal] : Université de Montréal, 2002. http://wwwlib.umi.com/cr/umontreal/fullcit?pNQ80476.
Texto completo"NQ-80476." "Thèse présentée à la faculté des études supérieures en vue de l'obtention du grade de docteur ès sciences (Ph. D.) en informatique." Version électronique également disponible sur Internet.
FAVRE, Luc. "Propriétés structurales et magnétiques d'agrégats mixtes CoxPt1-x et CoAg. Effets de proximité et blocage de Coulomb via un agrégat isolé". Phd thesis, Université Claude Bernard - Lyon I, 2004. http://tel.archives-ouvertes.fr/tel-00008878.
Texto completo