Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/342305
Title: Analysis of Queueing System with Non-Preemptive Time Limited Service and Impatient Customers
Authors: Kim, S.
Dudin, A.N.
Dudina, O.A.
Klimenok, V.
Open Researcher and Contributor ID: 0000-0003-2881-0227
0000-0002-3903-6444
Keywords: ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетика
ЭБ БГУ::ТЕХНИЧЕСКИЕ И ПРИКЛАДНЫЕ НАУКИ. ОТРАСЛИ ЭКОНОМИКИ::Автоматика. Вычислительная техника
Issue Date: 2020
Publisher: Springer Nature
Citation: Methodology and Computing in Applied Probability.2020; 22(2): P. 401-432
Abstract: We consider a single-server queueing system with server vacations as the important component of the polling queueing model of a real-world system. Period of continuous operation of the server (the maximum server attendance time) is restricted, but the service of a customer cannot be interrupted when this period expires. Such features are inherent for many real-world systems with resource sharing. We assume that the customers arrival is described by the Markovian Arrival Process and service, vacation and maximum server attendance times have a phase-type distribution. We derive the stationary distributions of the system states and waiting time. Taking in mind the necessity of further application of the results to modeling the polling queueing systems, the distribution of the server visiting time is derived. Extensive numerical results are presented. They highlight that an account of the coefficient of variation of vacation and maximum attendance time is very important for exact evaluation of the key performance measures of the system, while only the results for the coefficient of variation equal to zero or one are known in the literature. Impact of the possible customers impatience, which is intuitively important because the time-limited service is considered, is confirmed by the results of the numerical experiments. Optimization problem of matching the durations of vacation and maximum attendance time is considered.
URI: https://elib.bsu.by/handle/123456789/342305
DOI: 10.1007/s11009-019-09707-7
Sponsorship: This research has been prepared with the support by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2017R1D1A3A03000523) and the support by RUDN University Program 5-100.
Licence: info:eu-repo/semantics/openAccess
Appears in Collections:Статьи факультета прикладной математики и информатики

Files in This Item:
File Description SizeFormat 
s11009-019-09707-7-1.pdf2,46 MBAdobe PDFView/Open
Show full item record Google Scholar



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.