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ę "systemy kolejkowe" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    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ł:
    Multi-server closed queueing system with limited buffer space
    Autorzy:
    Tikhonenko, A.
    Tikhonenko-Kędziak, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/122285.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    total requests capacity
    memory space
    loss probability
    Stieltjes convolution
    systemy kolejkowe
    splot Stieltjesa
    liczba zgłoszeń
    pojemność pamięci
    Opis:
    In the paper, we investigate multi-server closed queueing systems with identical servers and a finite number of terminals. Requests from each terminal are characterized by a random space requirement (volume), the request service time doesn’t depend on its volume and has an exponential distribution. The total requests capacity in the system is limited by a positive value (buffer space memory volume) V. For such systems, stationary requests number distribution and loss probability are determined. The analogous results for open multi-server systems are obtained as a limit case. Some numerical results are attached as well.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 1; 117-125
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Finding the probabilistically-temporal characteristics of Markov G-network with batch removal of positive customers
    Autorzy:
    Matalytski, M.
    Naumenko, V.
    Kopats, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/122998.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    G-network
    positive and negative customers
    customers batch removal
    nonstationary regime
    generation function
    state probabilities
    teoria kolejek
    systemy kolejkowe
    pozytywny klient
    Opis:
    The investigation of a Markov queueing network with positive and negative customers and positive customers batch removal has been carried out in the article. The purpose of the research is analysis of such a network at the non-stationary regime, finding the time-dependent state probabilities and mean number of customers. In the first part of this article, a description of the G-network operation is provided with one-line queueing systems. When a negative customer arrives to the system, the count of positive customers is reduced by a random value, which is set by some probability distribution. Then for the non-stationary state probabilities a Kolmogorov system was derived of differencedifferential equations. A technique for finding the state probabilities and the mean number of customers of the investigated network, based on the use of an apparatus of multidimensional generating functions has been proposed. The theorem about the expression for the generating function has been given. A model example has been calculated.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 4; 125-136
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    About one method of finding expected incomes in HM-queueing network with positive customers and signals
    Autorzy:
    Matalytski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/122974.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    HM-queueing network
    positive and negative customers
    signals
    expected incomes
    ransient regime
    kolejkownie sieci
    systemy kolejkowe
    pozytywny klient
    negatywny klient
    teoria kolejek
    Opis:
    In the paper an open Markov HM(Howard-Matalytski)-Queueing Network (QN) with incomes, positive customers and signals (G(Gelenbe)-QN with signals) is investigated. The case is researched, when incomes from the transitions between the states of the network are random variables (RV) with given mean values. In the main part of the paper a description is given of G-network with signals and incomes, all kinds of transition probabilities and incomes from the transitions between the states of the network. The method of finding expected incomes of the researched network was proposed, which is based on using of found approximate and exact expressions for the mean values of random incomes. The variances of incomes of queueing systems (QS) was also found. A calculation example, which illustrates the differences of expected incomes of HM-networks with negative customers and QN without them and also with signals, has been given. The practical significance of these results consist of that they can be used at forecasting incomes in computer systems and networks (CSN) taking into account virus penetration into it and also at load control in such networks.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 1; 87-98
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Formulas for average transition times between states of the Markov birth-death process
    Autorzy:
    Zhernovyi, Yuriy
    Kopytko, Bohdan
    Powiązania:
    https://bibliotekanauki.pl/articles/2175497.pdf
    Data publikacji:
    2021
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    birth-death process
    Markov models
    mean transition time
    mean time spent in the group of states
    queueing systems
    reliability model
    proces narodzin i śmierci
    modele Markova
    średni czas przejścia
    średni czas spędzony w grupie stanów
    systemy kolejkowe
    model niezawodności
    Opis:
    In this paper, we consider Markov birth-death processes with constant intensities of transitions between neighboring states that have an ergodic property. Using the exponential distributions properties, we obtain formulas for the mean time of transition from the state i to the state j and transitions back, from the state j to the state i. We found expressions for the mean time spent outside the given state i, the mean time spent in the group of states (0,...,i-1) to the left from state i, and the mean time spent in the group of states (i+1,i+2,...) to the right. We derive the formulas for some special cases of the Markov birth-death processes, namely, for the Erlang loss system, the queueing systems with finite and with infinite waiting room and the reliability model for a recoverable system.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2021, 20, 4; 99--110
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Simulation of a vehicular traffic system based on queueing network models: comparative analysis of two models
    Autorzy:
    Pasini, Leonardo
    Del Giudice, Nicola
    Powiązania:
    https://bibliotekanauki.pl/articles/1954603.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Gdańska
    Tematy:
    vehicular traffic systems
    queuing networks
    modeling
    simulation
    systemy ruchu kołowego
    sieci kolejkowe
    modelowanie
    symulacja
    Opis:
    In the previous works we presented a study for modeling and simulation of vehicular traffic systems based on queuing networks. Specifically, in paper (Pasini and Bianchini, 2019), we studied the urban network located in North Siena, in the city of Siena (Italy), in its actual layout, after the Municipality had introduced some changes for vehicular flow management. This system is based on two roundabouts and a crossroad, as shown in Figure 1. In this work, we are going to conclude our previous study, comparing the actual vehicular flow and the flow derived from an alternative system, foreseen by the PRG of the Municipality of Siena which is composed of three roundabouts and which has not been implemented yet.
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2020, 24, 3; 243-292
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Zastosowanie teorii masowej obsługi do modelowania systemów transportowych
    Autorzy:
    Kisielewski, P.
    Sobota, Ł.
    Powiązania:
    https://bibliotekanauki.pl/articles/312316.pdf
    Data publikacji:
    2016
    Wydawca:
    Instytut Naukowo-Wydawniczy "SPATIUM"
    Tematy:
    system masowej obsługi
    systemy transportowe
    stacje paliw
    myjnie samochodowe
    sieci kolejkowe
    queueing system
    transport systems
    filling station
    car washes
    Opis:
    W artykule przedstawiono zastosowanie teorii masowej obsługi do analizy i modelowania wybranych systemów transportowych.
    Źródło:
    Autobusy : technika, eksploatacja, systemy transportowe; 2016, 17, 6; 600-604
    1509-5878
    2450-7725
    Pojawia się w:
    Autobusy : technika, eksploatacja, systemy transportowe
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      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