Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "queueing systems" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Firefly algorithm in optimization of queueing systems
    Autorzy:
    Kwiecień, J.
    Filipowicz, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/201299.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    queueing systems
    firefly algorithm
    Opis:
    Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 363-368
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance evaluation of unreliable system with infinite number of servers
    Autorzy:
    Tikhonenko, O.
    Ziółkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/201519.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    queueing systems with non-homogeneous customers
    unreliable queueing systems
    total volume
    loss probability
    Laplace–Stieltjes transform
    Opis:
    In the paper, we investigate queueing system M/G/∞ with non-homogeneous customers. By non-homogeneity we mean that each customer is characterized by some arbitrarily distributed random volume. The arriving customers appear according to a stationary Poisson process. Service time of a customer is proportional to his its volume. The system is unreliable, which means that all its servers can break simultaneously and then the repair period goes on for random time having an arbitrary distribution. During this period, customers present in the system and arriving to it are not served. Their service continues immediately after repair period termination. Time intervals of the system in good repair mode have an exponential distribution. For such system, we determine steady-state sojourn time and total volume of customers present in it distributions. We also estimate the loss probability for the similar system with limited total volume. An analysis of some special cases and some numerical examples are attached as well.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 2; 289-297
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    M/G→ /n/0 Erlang queueing system with heterogeneous servers and non-homogeneous customers
    Autorzy:
    Ziółkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/199840.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    multi-server queueing systems
    queueing systems with non-homogeneous customers
    queueing systems with heterogeneous servers
    total volume distribution
    Laplace–Stieltjes transform
    system kolejkowania
    transformata Laplace'a-Stieltjesa
    dystrybucja
    Opis:
    In the present paper, we investigate a multi-server queueing system with heterogeneous servers, unlimited memory space, and non-homogeneous customers. The arriving customers appear according to a stationary Poisson process. Service time distribution functions may be different for every server. Customers are additionally characterized by some random volume. On every server, the service time of the customer depends on their volume. The number of customers distribution function is obtained in the classical model of the system. In the model with non-homogeneous customers, the stationary total volume distribution function is determined in the term of Laplace–Stieltjes transform. The stationary first and second moments of a total customers volume are calculated. An analysis of some special cases of the model and some numerical examples are also included.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 1; 59-66
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of firefly and cockroach algorithms in selected discrete and combinatorial problems
    Autorzy:
    Kwiecień, J.
    Filipowicz, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/200148.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    queueing systems
    flow shop scheduling
    firefly algorithm
    cockroach algorithm
    systemy kolejkowe
    planowanie przepływów
    algorytm świetlika
    algorytm karaluch
    Opis:
    In recent years, newer algorithms inspired by nature have been created and used to solve various problems. Therefore, in the paper we present the application of firefly and cockroach algorithms to optimize two queueing systems and permutation flow shop problems with the objective of minimizing the makespan. The article briefly describes these algorithms to solve selected problems and their results. Because these algorithms were originally developed for continuous optimization problems, we introduce a new formula to transform the position of ith individual to solve the discrete problems.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 797-804
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Single–server queueing system with limited queue, random volume customers and unlimited sectorized memory buffer
    Autorzy:
    Ziółkowski, Marcin
    Tikhonenko, Oleg
    Powiązania:
    https://bibliotekanauki.pl/articles/2173725.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    single-server queueing system
    queueing systems with random volume customers
    sectorized memory buffer
    total volume vector
    Laplace-Stieltjes transform
    system kolejkowy z jednym serwerem
    system kolejkowy z losowymi klientami
    bufor pamięci sektorowany
    wektor objętości całkowity
    transformata Laplace'a-Stieltjesa
    Opis:
    In the present paper, we analyze the model of a single–server queueing system with limited number of waiting positions, random volume customers and unlimited sectorized memory buffer. In such a system, the arriving customer is additionally characterized by a non– negative random volume vector whose indications usually represent the portions of unchanged information of a different type that are located in sectors of unlimited memory space dedicated for them during customer presence in the system. When the server ends the service of a customer, information immediately leaves the buffer, releasing resources of the proper sectors. We assume that in the investigated model, the service time of a customer is dependent on his volume vector characteristics. For such defined model, we obtain a general formula for steady–state joint distribution function of the total volume vector in terms of Laplace-Stieltjes transforms. We also present practical results for some special cases of the model together with formulae for steady–state initial moments of the analyzed random vector, in cases where the memory buffer is composed of at most two sectors. Some numerical computations illustrating obtained theoretical results are attached as well.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 6; art. no. e143647
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies