Random inspection schedules with non-decreasing intensity
Random networks with sublinear preferential attachment: degree evolutions.
Rang moyen et agrégation de classements
Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences
Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences
In this work we propose a ranking procedure. This procedure uses an ordinal information about the criterion weights and a non-cardinal or mixed information for the potential actions evaluation. The advantage of this procedure is that it uses the linear programming software packages to compute the intervals of relative proximities from where the rankings are obtained.
Ratio rewards in networks
Rational probabilistic deciders. I: Individual behavior.
Real time scheduling and routing for flexible manufacturing systems with unreliable machines
Recherche des Ensembles Minimum Pour une Cascade de Files D'attente Avec Impatiences
Reconfigurable control design with integration of a reference governor and reliability indicators
A new approach to manage actuator redundancy in the presence of faults is proposed based on reliability indicators and a reference governor. The aim is to preserve the health of the actuators and the availability of the system both in the nominal behavior and in the presence of actuator faults. The use of reference governor control allocation is a solution to distribute the control efforts among a redundant set of actuators. In a degraded situation, a reconfigured control allocation strategy is...
Reconfigurable Dynamic Cellular Manufacturing System: A New Bi-Objective Mathematical Model
Dynamic Cell Formation Problem (DCFP) seeks to cope with variation in part mix and demands using machine relocation, replication, and removing; whilst from practical point of view it is too hard to move machines between cells or invest on machine replication. To cope with this deficiency, this paper addresses Reconfigurable Dynamic Cell Formation Problem (RDCFP) in which machine modification is conducted instead of their relocation or replication in order to enhance machine capabilities to process...
Recursive estimation of inventory quality classes using sampling.
RedInv-SA : a simulated annealing for the quadratic assignment problem
Redinv-SA: la simulated annealing for the quadratic assignment problem
An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced theoretical results that can be applied to (meta) heuristics to give them information about the problem structure, allowing the construction of algorithms. In this paper those results were applied to inform a Simulated Annealing-type heuristic (which we called RedInv-SA). Some results from tests with known literature instances are presented.
Réductions et conditions d'optimalité dans le problème de l'ensemble stable de poids maximal
Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation
Long running software systems are known to experience an aging phenomenon called software aging, one in which the accumulation of errors during the execution of software leads to performance degradation and eventually results in failure. To counteract this phenomenon a proactive fault management approach, called software rejuvenation, is particularly useful. It essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. In this paper, we reconsider...
Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation
Long running software systems are known to experience an aging phenomenon called software aging, one in which the accumulation of errors during the execution of software leads to performance degradation and eventually results in failure. To counteract this phenomenon a proactive fault management approach, called software rejuvenation, is particularly useful. It essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. In this paper, we...
Regression Models in Planning of Experiments
Régularité des matrices à diagonale dominante. Applications à l'absorption dans les chaînes et processus de Markov
Regularity properties of optimal transportation problems arising in hedonic pricing models
We study a form of optimal transportation surplus functions which arise in hedonic pricing models. We derive a formula for the Ma–Trudinger–Wang curvature of these functions, yielding necessary and sufficient conditions for them to satisfy (A3w). We use this to give explicit new examples of surplus functions satisfying (A3w), of the form b(x,y) = H(x + y) where H is a convex function on ℝn. We also show that the distribution of equilibrium contracts in this hedonic pricing model is absolutely continuous...