Temat: czas obsługi Erlanga - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Recurrence relations for two-channel queueing systems with Erlangian service times and hysteretic strategy of random dropping of customers
Autorzy:: Zhernovyi, Y.
Kopytko, B.
Powiązania:: https://bibliotekanauki.pl/articles/122986.pdf
Data publikacji:: 2018
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: two-channel queueing system
Erlangian service times
random dropping of customers
fictitious phase method
hysteretic strategy
recurrence relations
steady-state characteristics
czas obsługi Erlanga
strategia histeretyczna
system kolejkowania dwukanałowy
Opis:: This article proposes a method of study the M/E_s/2/m and M/E_s/2/∞ queueing systems with a hysteretic strategy of random dropping of customers. Recurrence relations are obtained to compute the stationary distribution of the number of customers and steadystate characteristics. The constructed algorithms were tested on examples with the use of simulation models constructed with the help of GPSS World.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 2; 93-103
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Recurrence relations for two-channel closed queueing systems with Erlangian service times
Autorzy:: Kopytko, B.
Zhernovyi, K.
Powiązania:: https://bibliotekanauki.pl/articles/122421.pdf
Data publikacji:: 2018
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: two-channel closed queueing system
Erlangian service times
fictitious phase method
recurrence relations
system kolejkowania dwukanałowy
czas obsługi Erlanga
rozkład Erlanga
Opis:: This paper proposes a method for determining the steady-state characteristics of two-channel closed queueing systems with an exponential distribution of the time generation of service requests and the Erlang distributions of the service times. Recurrence relations for computing the steady-state distribution of the number of customers in the system are deduced. The obtained algorithms are tested on examples using simulation models in the GPSS World environment.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 1; 37-48
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja