The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed VNS approach reaches...
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
A cold-standby redundant sytem with two identical units and one repair facility is considered. Units can be in three states: good , degraded , and failed . It is supposed that only the following state-transitions of a unit are possible: , , , . The paper deals with the comparison of some initial situations of the system and with a stochastical improvement of units (stochastical increase of time of work in state and/or stochastical decrease of times of repairs of the types and/or ) and...
In this paper we are exploiting some similarities between Markov and Bellman processes and we introduce the main concepts of the paper: comparison of performance measures, and monotonicity of Bellman chains. These concepts are used to establish the main result of this paper dealing with comparison of Bellman chains.
In this work we study the nonlinear complementarity problem on the nonnegative orthant. This is done by approximating its equivalent variational-inequality-formulation by a sequence of variational inequalities with nested compact domains. This approach yields simultaneously existence, sensitivity, and stability results. By introducing new classes of functions and a suitable metric for performing the approximation, we provide bounds for the asymptotic set of the solution set and coercive existence...