Comparaison des disciplines de service des files d'attente G/G/1
Comparaisons par paires : une interprétation et une généralisation de la méthode des scores
Comparison of inventory systems with service, positive lead-time, loss, and retrial of customers.
Comparison of order statistics in a random sequence to the same statistics with I.I.D. variables
The paper is motivated by the stochastic comparison of the reliability of non-repairable -out-of- systems. The lifetime of such a system with nonidentical components is compared with the lifetime of a system with identical components. Formally the problem is as follows. Let be positive independent random variables with common distribution . For and , let consider and . Remark that this is no more than a change of scale for each term. For let us define to be the th order statistics...
Comparison of order statistics in a random sequence to the same statistics with i.i.d. variables
The paper is motivated by the stochastic comparison of the reliability of non-repairable k-out-of-n systems. The lifetime of such a system with nonidentical components is compared with the lifetime of a system with identical components. Formally the problem is as follows. Let Ui,i = 1,...,n, be positive independent random variables with common distribution F. For λi > 0 and µ > 0, let consider Xi = Ui/λi and Yi = Ui/µ, i = 1,...,n. Remark that this is no more than a change of scale for each...
Competitive inventory models
Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline.
Complexity of partial inverse assignment problem and partial inverse cut problem
For a given partial solution, the partial inverse problem is to modify the coefficients such that there is a full solution containing the partial solution, while the full solution becomes optimal under new coefficients, and the total modification is minimum. In this paper, we show that the partial inverse assignment problem and the partial inverse minimum cut problem are NP-hard if there are bound constraints on the changes of coefficients.
Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
For a given partial solution, the partial inverse problem is to modify the coefficients such that there is a full solution containing the partial solution, while the full solution becomes optimal under new coefficients, and the total modification is minimum. In this paper, we show that the partial inverse assignment problem and the partial inverse minimum cut problem are NP-hard if there are bound constraints on the changes of coefficients.
Comportement d'un processus de fabrication dans lequel interviennent des tests de contrôle
Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Single server queues with repeated attempts are useful in the modeling of computer and telecommunication systems. In addition, we consider in this paper the possibility of disasters. When a disaster occurs, all the customers present in the system are destroyed immediately. Using a regenerative approach, we derive a numerically stable recursion scheme for the state probabilities. This model can be employed to analyze the behaviour of a buffer in computers with virus infections.
Computational complexity of integrated models of network design and facility location.
Computational procedures for a class of GI/D/ systems in discrete time.
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Computer Network Design Problems
Computing the greatest -eigenvector of a matrix in max-min algebra
A vector is said to be an eigenvector of a square max-min matrix if . An eigenvector of is called the greatest -eigenvector of if and for each eigenvector . A max-min matrix is called strongly -robust if the orbit reaches the greatest -eigenvector with any starting vector of . We suggest an algorithm for computing the greatest -eigenvector of and study the strong -robustness. The necessary and sufficient conditions for strong -robustness are introduced and an efficient...
Concept of Expert System for Modal Split in Transportation Planning
Conditions for lumping the grades of a hierarchical manpower system