Informacja

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

Wyszukujesz frazę "Kim, C." wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
A queueing system with heterogeneous impatient customers and consumable additional items
Autorzy:
Baek, J.
Dudina, O.
Kim, C.
Powiązania:
https://bibliotekanauki.pl/articles/907646.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
marked Markovian arrival process
consumable additional items
phase type distribution
impatient customer
Markowski proces zgłoszeń
system kolejkowy
rozkład fazowy
klient niecierpliwy
Opis:
A single-server queueing system with a marked Markovian arrival process of heterogeneous customers is considered. Type-1 customers have limited preemptive priority over type-2 customers. There is an infinite buffer for type-2 customers and no buffer for type-1 customers. There is also a finite buffer (stock) for consumable additional items (semi-products, half-stocks, etc.) which arrive according to the Markovian arrival process. Service of a customer requires a fixed number of consumable additional items depending on the type of the customer. The service time has a phase-type distribution depending on the type of the customer. Customers in the buffer are impatient and may leave the system without service after an exponentially distributed amount of waiting time. Aiming to minimize the loss probability of type-1 customers and maximize throughput of the system, a threshold strategy of admission to service of type-2 customers is offered. Service of type-2 customer can start only if the server is idle and the number of consumable additional items in the stock exceeds the fixed threshold. Stationary distributions of the system states and the waiting time are computed. In the numerical example, we show some interesting effects and illustrate a possibility of application of the presented results for solution of optimization problems.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 367-384
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of an MMAP/PH1, PH2/N/∞ queueing system operating in a random environment
Autorzy:
Kim, C.
Dudin, A.
Dudin, S.
Dudina, O.
Powiązania:
https://bibliotekanauki.pl/articles/330607.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
random environment
marked Markovian arrival process
phase type distribution
Laplace–Stieltjes transform
rozkład fazowy
transformata Laplace'a-Stieltjesa
system operacyjny
system kolejkowy
Opis:
A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process. Type 1 customers have a non-preemptive priority over type 2 customers and can leave the buffer due to a lack of service. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the investigation of the system we use a generalized phase-type service time distribution. The criterion of ergodicity for a multi-dimensional Markov chain describing the behavior of the system and the algorithm for computation of its steady-state distribution are outlined. Some key performance measures are calculated. The Laplace–Stieltjes transforms of the sojourn and waiting time distributions of priority and non-priority customers are derived. A numerical example illustrating the importance of taking into account the correlation in the arrival process is presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 485-501
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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