Tesis sobre el tema "Contraintes de blocage mixtes"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 26 mejores tesis para su investigación 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.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
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 completoFavre, 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é". Lyon 1, 2004. http://tel.archives-ouvertes.fr/docs/00/04/79/19/PDF/tel-00008922.pdf.
Texto completoFavre, Luc Dupuis Véronique. "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é /". Villeurbanne : Université Claude Bernard, 2004. http://tel.archives-ouvertes.fr/docs/00/04/79/19/PDF/tel-00008922.pdf.
Texto completoGiraud, Moreau Laurence. "Optimisation des systèmes mécaniques : couplage de méthodes déterministes et évolutionnaires par les problèmes en variables mixtes". Troyes, 1999. http://www.theses.fr/1999TROY0006.
Texto completoPeng, Shen. "Optimisation stochastique avec contraintes en probabilités et applications". Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS153/document.
Texto completoChance constrained optimization is a natural and widely used approaches to provide profitable and reliable decisions under uncertainty. And the topics around the theory and applications of chance constrained problems are interesting and attractive. However, there are still some important issues requiring non-trivial efforts to solve. In view of this, we will systematically investigate chance constrained problems from the following perspectives. As the basis for chance constrained problems, we first review some main research results about chance constraints in three perspectives: convexity of chance constraints, reformulations and approximations for chance constraints and distributionally robust chance constraints. For stochastic geometric programs, we formulate consider a joint rectangular geometric chance constrained program. With elliptically distributed and pairwise independent assumptions for stochastic parameters, we derive a reformulation of the joint rectangular geometric chance constrained programs. As the reformulation is not convex, we propose new convex approximations based on the variable transformation together with piecewise linear approximation methods. Our numerical results show that our approximations are asymptotically tight. When the probability distributions are not known in advance or the reformulation for chance constraints is hard to obtain, bounds on chance constraints can be very useful. Therefore, we develop four upper bounds for individual and joint chance constraints with independent matrix vector rows. Based on the one-side Chebyshev inequality, Chernoff inequality, Bernstein inequality and Hoeffding inequality, we propose deterministic approximations for chance constraints. In addition, various sufficient conditions under which the aforementioned approximations are convex and tractable are derived. To reduce further computational complexity, we reformulate the approximations as tractable convex optimization problems based on piecewise linear and tangent approximations. Finally, based on randomly generated data, numerical experiments are discussed in order to identify the tight deterministic approximations. In some complex systems, the distribution of the random parameters is only known partially. To deal with the complex uncertainties in terms of the distribution and sample data, we propose a data-driven mixture distribution based uncertainty set. The data-driven mixture distribution based uncertainty set is constructed from the perspective of simultaneously estimating higher order moments. Then, with the mixture distribution based uncertainty set, we derive a reformulation of the data-driven robust chance constrained problem. As the reformulation is not a convex program, we propose new and tight convex approximations based on the piecewise linear approximation method under certain conditions. For the general case, we propose a DC approximation to derive an upper bound and a relaxed convex approximation to derive a lower bound for the optimal value of the original problem, respectively. We also establish the theoretical foundation for these approximations. Finally, simulation experiments are carried out to show that the proposed approximations are practical and efficient. We consider a stochastic n-player non-cooperative game. When the strategy set of each player contains a set of stochastic linear constraints, we model the stochastic linear constraints of each player as a joint chance constraint. For each player, we assume that the row vectors of the matrix defining the stochastic constraints are pairwise independent. Then, we formulate the chance constraints with the viewpoints of normal distribution, elliptical distribution and distributionally robustness, respectively. Under certain conditions, we show the existence of a Nash equilibrium for the stochastic game
Mitjana, Florian. "Optimisation topologique de structures sous contraintes de flambage". Thesis, Toulouse 3, 2018. http://www.theses.fr/2018TOU30343/document.
Texto completoTopology optimization aims to design a structure by seeking the optimal material layout within a given design space, thus making it possible to propose innovative optimal designs. This thesis focuses on topology optimization for structural problems taking into account buckling constraints. In a wide variety of engineering fields, innovative structural design is crucial. The lightening of structures during the design phase holds a prominent place in order to reduce manufacturing costs. Thus the goal is often the minimization of the mass of the structure to be designed. Regarding the constraints, in addition to the conventional mechanical constraints (compression, tension), it is necessary to take into account buckling phenomena which are characterized by an amplification of the deformations of the structure and a potential annihilation of the capabilities of the structure to support the applied efforts. In order to adress a wide range of topology optimization problems, we consider the two types of representation of a structure: lattice structures and continuous structures. In the framework of lattice structures, the objective is to minimize the mass by optimizing the number of elements of the structure and the dimensions of the cross sections associated to these elements. We consider structures constituted by a set of frame elements and we introduce a formulation of the problem as a mixed-integer nonlinear problem. In order to obtain a manufacturable structure, we propose a cost function combining the mass and the sum of the second moments of inertia of each frame. We developed an algorithm adapted to the considered optimization problem. The numerical results show that the proposed approach leads to significant mass gains over existing approaches. In the case of continuous structures, topology optimization aims to discretize the design domain and to determine the elements of this discretized domain that must be composed of material, thus defining a discrete optimization problem. [...]
Fortin, Mathieu. "Analyse de la dynamique des peuplements mixtes de sapin baumier et d'épinette rouge après coupe partielle : contraintes et méthodologies statistiques". Doctoral thesis, Université Laval, 2006. http://hdl.handle.net/20.500.11794/33025.
Texto completoThuilier, Juliette. "Contraintes préférentielles et ordre des mots en français". Phd thesis, Université Paris-Diderot - Paris VII, 2012. http://tel.archives-ouvertes.fr/tel-00781228.
Texto completoAl, Tahan Rana. "Formulation de systèmes mixtes alumine/kaolin : Application à l'élaboration de matériaux multicouches par co-pressage". Electronic Thesis or Diss., Limoges, 2023. http://www.theses.fr/2023LIMO0072.
Texto completoMultilayer ceramic architectures generally exhibit improved mechanical properties in regards with individual monolithic constituents. In alumina-based materials, addition of kaolin can advantageously promote i) mullite crystallisation and ii) internal residual stresses by monitoring thermal expansion mismatch between layers. From powders prepared by freeze granulation whose formulations contain a reduce amount of organic additives, alumina/mullite composites shaped by uniaxial pressing have been developed and characterized. Two different kaolins are used in this study, with different characteristics in terms of crystallinity, grain shape, layering and basal/lateral face ratio. The originality of this work consisted in studying in detail the dispersion mechanisms of kaolinite suspensions in aqueous media by acoustophoresis, and in highlighting the relationship between kaolinite's electrokinetic properties, physicochemical characteristics and thermal pretreatment between 200 and 800°C. The sintering properties of mixed alumina/kaolinite formulations were studied as a function of kaolinite crystallinity and content (0-25%vol). This thesis studies the integrated chain of a ceramic process, starting with the selection of kaolinite as a raw material (acoustophoresis, MAS NMR), its crystallochemical transformation into mullite (thermal analyses, dilatometry) and its incorporation into an alumina matrix for an original architecture of multilayer materials with modified properties of toughness and fracture resistance. The multi-layer materials developed show good interfacial adhesion despite the presence of a porous zone close to the layer interface. Compared to the monolithic materials, the most efficient multilayer configurations exhibit a failure stress improved by 30%
Blanc, Fabienne. "Disponibilite spatiale au paturage : consequences des contraintes sociales sur les performances de croissance d'ovins et de cervides conduits en groupes monospecifiques ou mixtes". Montpellier, ENSA, 1998. http://www.theses.fr/1998ENSA0008.
Texto completoPernet, Nicolas. "Implantation distribuée temps réel de programmes conditionnés à l'aide d'ordonnancements mixtes hors-ligne en-ligne de tâches périodiques avec contraintes de latence et acceptation de tâches apériodiques". Paris 6, 2006. http://www.theses.fr/2006PA066625.
Texto completoBoyer, Francois. "Suspensions concentrées : expériences originales de rhéologie". Thesis, Aix-Marseille 1, 2011. http://www.theses.fr/2011AIX10128.
Texto completoIn 1970, George K. Batchelor suggested that the knowledge of the laws of hydrodynamics made possible the derivation of macroscopic rheological properties such as the effective viscosity, from the knowledge of the microstructure of a suspension of particles. Forty years later, his hopes have not materialized and the rheology of suspensions, particularly in the concentrated regime, remains an area of active research. Considering suspensions of non-colloidal particles in a Newtonian liquid, the experimental work in this thesis was first attached to unify the concepts traditionally defined rheology of suspensions and those from recent advances on granular flows. For this purpose, an original of shear imposed pressure was developed and showed a clear characterization of constitutive equations in the dense regime. Subsequently, the configurations of free surface flows have been used for the measurement of both normal stress differences. Finally, the coherence of all the experimental results gives a complete and consistent formulation of the rheology of non-colloidal suspensions
Nikbakht, Homa. "Networks with mixed-delay constraints". Electronic Thesis or Diss., Institut polytechnique de Paris, 2020. http://www.theses.fr/2020IPPAT046.
Texto completoModern wireless communication networks have to accommodate different types of data traffic with different latency constraints. In particular, delay-sensitive video-applications represent an increasing portion of data traffic. Modern networks also have to accommodate high total data rates, which they can accomplish for example with cooperating terminals or with helper relays such as drones. However, cooperation typically introduces additional communication delays, and is thus not applicable to delay-sensitive data traffic.This thesis focuses on interference networks with mixed-delay constraints and on system architectures where neighbouring transmitters and/or neighbouring receivers can cooperate. In such systems, delay-sensitive messages have to be encoded and decoded without further delay and thus cannot benefit from available cooperation links.We propose various coding schemes that can simultaneously accommodate the transmission of both delay-sensitive and delay-tolerant messages. For the proposed schemes we analyze the multiplexing gains (MG) they achieve over Wyner's soft hand-off network, Wyner's symmetric network, the hexagonal network and the sectorized hexagonal network. For Wyner's soft hand-off network and Wyner's symmetric network, we also provide tight information-theoretic converse results and thus establish the exact set of MG pairs that can simultaneously be achieved for delay-sensitive and delay-tolerant data. These results demonstrate that when both transmitters and receivers cooperate and the cooperation rates are sufficiently large, it is possible to achieve the largest MG for delay-sensitive messages without penalizing the maximum sum MG of both delay-sensitive and delay-tolerant messages. In contrast, under our proposed schemes, the sending of delay-sensitive data in hexagonal models decreases the maximum sum MG. This penalty vanishes when we consider the sectorized hexagonal network where each cell is divided into three non-interfering sectors by employing directional antennas at the base stations.We further propose similar coding schemes for scenarios with different types of random user activity. We specifically consider two setups. In the first setup, each active transmitter always has delay-tolerant data to send and delay-sensitive data arrival is random. In the second setup, both delay-tolerant and delay-sensitive data arrivals are random. The obtained MG regions show that in the first setup, increasing the delay-sensitive MG always decreases the sum MG. In contrast, in the second setup, for certain parameters, the highest sum MG is achieved at maximum delay-sensitive MG and thus increasing the delay-sensitive MG provides a gain in sum MG.Additionally, we also study a cloud radio access network with mixed delay constraints, i.e., where each mobile user can simultaneously send a delay-sensitive and a delay-tolerant stream and only the delay-tolerant data is jointly decoded at the cloud unit. For this network, we derive inner and outer bounds on the capacity region under mixed delay constraints, and we exactly characterize the optimal MG region. At high signal-to-noise ratio (SNR), our results show that for moderate fronthaul capacities, the maximum MG for delay-sensitive messages remains unchanged over a large regime of small and moderate MGs of delay-sensitive messages. The sum MG is thus improved if some of the messages can directly be decoded at the base stations. At moderate SNR, the results show that when the data rate of delay-sensitive messages is small or moderate, the achievable sum rate is constant
Dahito, Marie-Ange. "Constrained mixed-variable blackbox optimization with applications in the automotive industry". Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAS017.
Texto completoNumerous industrial optimization problems are concerned with complex systems and have no explicit analytical formulation, that is they are blackbox optimization problems. They may be mixed, namely involve different types of variables (continuous and discrete), and comprise many constraints that must be satisfied. In addition, the objective and constraint blackbox functions may be computationally expensive to evaluate.In this thesis, we investigate solution methods for such challenging problems, i.e constrained mixed-variable blackbox optimization problems involving computationally expensive functions.As the use of derivatives is impractical, problems of this form are commonly tackled using derivative-free approaches such as evolutionary algorithms, direct search and surrogate-based methods.We investigate the performance of such deterministic and stochastic methods in the context of blackbox optimization, including a finite element test case designed for our research purposes. In particular, the performance of the ORTHOMADS instantiation of the direct search MADS algorithm is analyzed on continuous and mixed-integer optimization problems from the literature.We also propose a new blackbox optimization algorithm, called BOA, based on surrogate approximations. It proceeds in two phases, the first of which focuses on finding a feasible solution, while the second one iteratively improves the objective value of the best feasible solution found. Experiments on instances stemming from the literature and applications from the automotive industry are reported. They namely include results of our algorithm considering different types of surrogates and comparisons with ORTHOMADS
Meaud, Charlotte. "Analyse multi-échelle des connexions par collage : application aux éléments structuraux multimatériaux fléchis". Phd thesis, Université Claude Bernard - Lyon I, 2012. http://tel.archives-ouvertes.fr/tel-00977408.
Texto completoSeydou, Hassane Ramatou. "Contribution au développement des techniques ensemblistes pour l’estimation de l’état et des entrées des systèmes à temps continu : application à la détection de défauts". Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14669/document.
Texto completoThis thesis deals with the problem of a dynamical system observation and the estimation of its characteristic variables; the latter point constitutes the core element in many engineering science fields. The final aim is to build a general framework for integrity control and fault detection of such systems within a bounded error context. The developments offered herein make use of parity relations, sliding mode differentiators, interval observers and constraint satisfaction problems. Input reconstruction techniques are developed for a general class of nonlinear continuous-time systems. Domains are reconstructed for the input values which are consistent with the measurements using interval analysis and constraint satisfaction techniques. It is shown that time-varying or invariant coordinate changes may relax the applicability conditions (stability/cooperativity) of the interval observer design methods. Sliding mode differentiators were also used to enhance interval observer accuracy. The proposed approaches are illustrated through computer simulations and they have been applied to aircraft servo loop control surface for robust and early detection of abnormal positions
Rousseau, Louis-Martin. "Gestion de flotte avec fenêtres horaires : approches de résolution mixtes utilisant la programmation par contraintes". Thèse, 2002. http://hdl.handle.net/1866/14497.
Texto completo