Scheme for determining the jump priorities in queuing systems with heteregeneous servers
نویسندگان
چکیده
منابع مشابه
minimizing loss probability in queuing systems with heterogeneous servers
the probability of losing a customer in m/g/n/0 and gi/m/n/0 loss queuing systems withheterogeneous servers is minimized. the first system uses a queue discipline in which a customer who arriveswhen there are free servers chooses any one of them with equal probability, but is lost otherwise. providedthat the sum of the servers rates are fixed, loss probability in this system attains minimum val...
متن کاملMetastability of Queuing Networks with Mobile Servers
We study symmetric queuing networks with moving servers and FIFO service discipline. The mean-field limit dynamics demonstrates unexpected behavior which we attribute to the metastability phenomenon. Large enough finite symmetric networks on regular graphs are proved to be transient for arbitrarily small inflow rates. However, the limiting non-linear Markov process possesses at least two statio...
متن کاملApplication of queuing theory in inventory systems with substitution flexibility
Considering the competition in today’s business environment, tactical planning of a supply chain becomes more complex than before. In many multi-product inventory systems, substitution flexibility can improve profits. This paper aims to prepare a comprehensive substitution inventory model, where an inventory system with two substitute products with ignorable lead time has been considered, and e...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولAlgorithms for Determining File Distribution in Networks with Multimedia Servers
In this paper, we consider an optimization problem in networks with storage servers for providing multimedia service. The design involves assigning communication link capacity, sizing the multimedia servers and distributing di erent types of content at each server, while guaranteeing an upper limit on the individual end-to-end blocking probability. We present optimization algorithms to obtain a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Informatization and Management
سال: 2021
ISSN: 2073-4751
DOI: 10.18372/2073-4751.65.15371