Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic.
Asymptotic distributions and chaos for the supermarket model.
Asymptotic performance characteristics of CSMA and CSMACDCSMA/CD networks.
Asymptotic properties and optimization of some non-Markovian stochastic processes
We study the limit behavior of certain classes of dependent random sequences (processes) which do not possess the Markov property. Assuming these processes depend on a control parameter we show that the optimization of the control can be reduced to a problem of nonlinear optimization. Under certain hypotheses we establish the stability of such optimization problems.
Asymptotic stability of a repairable system with imperfect switching mechanism.
Atypical Employment Increasing The Flexibility Of An Organization. A Study Of Greek Manufacturing And Services
Availability analysis of series systems with cold standby components and general repair time.
Availability and MTTF of a system with one warm standby component.
Availability and reliability of a 2-unit 2-server system subject to preventive maintenance and repair
Awareness, belief, and communication reaching consensus.
Balance locale dans les réseaux à trois stations
Balancing the stations of a self service “bike hire” system
This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that and all quantities...
Balancing the stations of a self service “bike hire” system
This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that and all quantities...
Batch scheduling on two-machine flowshop with machine-dependent setup times.
Batch scheduling problem with due-date and fuzzy precedence relation
A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy precedence....
Behaviour of passage time for a queueing network model with feedback: a simulation study.
Belief functions induced by multimodal probability density functions, an application to the search and rescue problem
In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...
Belief functions induced by multimodal probability density functions, an application to the search and rescue problem
In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...
Bicriterion release policy for exponential software reliability growth model
Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)