Reliability of communication networks with delay constraints: computational complexity and complete topologies.
Reliability of modules with load-sharing components.
Reliability of system with dependent units
The availability of a system with dependent units is obtained in the case where the system fails when one of the essential units fails. Markov model is assumed. The system considered consists of dependent units of which units are essential units. A unit is said to be essential if its failure causes the system to fail. The mean and variance of time to system failure are given. Unit reliability is also discussed.
Reliability with Preventive Maintenance.
Remarks on flows in network with short paths
Répartition optimale de la puissance dans une centrale hydraulique à réserve pompée
Représentation de matrices euclidiennes en vue de leur génération aléatoire
Representation of equilibrium solutions to the table problem of growing sandpiles
In the dynamical theory of granular matter the so-called table problem consists in studying the evolution of a heap of matter poured continuously onto a bounded domain . The mathematical description of the table problem, at an equilibrium configuration, can be reduced to a boundary value problem for a system of partial differential equations. The analysis of such a system, also connected with other mathematical models such as the Monge–Kantorovich problem, is the object of this paper. Our main...
Réseaux de files d'attente à forme produit
Réseaux stochastiques
Reservicing some customers in M/G/1 queues under three disciplines.
Résolution de problèmes d'optimisation dynamique par programmation dynamique marginaliste
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
Résolution directe du problème général de distribution
Résolution d'un problème d'ordonnancement à ressources variables
Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources
Resource allocation in a mobile telephone network : a constructive repair algorithm
To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved...
Resource allocation in a mobile telephone network: A constructive repair algorithm
To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved...
Resource relocation on asymmetric networks.
Restricted admissibility of batches into an //1 type bulk queue with modified Bernoulli schedule server vacations
We investigate the steady state behavior of an //1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various states of...