Extended block replacement models
Extended optimal age replacement policy with minimal repair
Extension of reverse elimination method through a dynamic management of the tabu list
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM, the so-called...
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM, the so-called...
Extension of stochastic dominance theory to random variables
Extension of stochastic dominance theory to random variables
In this paper, we develop some stochastic dominance theorems for the location and scale family and linear combinations of random variables and for risk lovers as well as risk averters that extend results in Hadar and Russell (1971) and Tesfatsion (1976). The results are discussed and applied to decision-making.
Extensions of Foster's averaging formula to infinite networks with moderate growth.
Factors affecting research productivity of production and operations management groups: An empirical study.
Failure free warranty policies for non-repairable products : a review and some extensions
Fast approximation of minimum multicast congestion – Implementation versus theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with edges and multicast requests, an -approximation can be computed in time, where bounds the time for computing an -approximate minimum Steiner tree. Moreover, we present a new fast heuristic that...
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r(1 + ε)(rOPT + exp(1)lnm)-approximation can be computed in O(kmε-2lnklnm) time, where β bounds the time for computing an r-approximate minimum Steiner tree. Moreover,...
Fast simulation for road traffic network
In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.
Fast simulation for Road Traffic Network
In this paper we present a method to perform fast simulation of large Markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.
Fault diagnosis of networked control systems
Networked Control Systems (NCSs) deal with feedback control systems with loops closed via data communication networks. Control over a network has many advantages compared with traditionally controlled systems, such as a lower implementation cost, reduced wiring, simpler installation and maintenance and higher reliability. Nevertheless, the networkinduced delay, packet dropout, asynchronous behavior and other specificities of networks will degrade the performance of closed-loop systems. In this context,...
Fault injection stress strategies in dependability analysis
Fiabilité d'un équipement sur lequel sont effectuées des opérations de maintenance préventive
Files d'attente à rejet différé
Finding Minimal Branchings With a Given Number of Arcs
Finding target units in FDH model by least-distance measure model
Recently, some authors used the Least-Distance Measure model in order to obtain the shortest distance between the evaluated Decision Making Unit (DMU) and the strongly efficient production frontier. But, their model is not applicable for situation in which the production possibility set satisfies free disposability property. In this paper, we propose a new approach to this end in FDH model which improves the application potential of the Least-Distance Measure and overcomes the mentioned shortcoming....
Finding the conductors in circular networks from boundary measurements