Logo BSU

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот документ: https://elib.bsu.by/handle/123456789/342281
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorKim, S.-
dc.contributor.authorDudin, A.N.-
dc.contributor.authorDudina, O.-
dc.contributor.authorKlimenok, V.-
dc.date.accessioned2026-02-23T10:19:57Z-
dc.date.available2026-02-23T10:19:57Z-
dc.date.issued2020-
dc.identifier.citationMethodology and Computing in Applied Probability.2020; 22(2): P. 401-432ru
dc.identifier.urihttps://elib.bsu.by/handle/123456789/342281-
dc.description.abstractWe 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.ru
dc.language.isoenru
dc.publisherSpringer Natureru
dc.rightsinfo:eu-repo/semantics/openAccessru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетикаru
dc.subjectЭБ БГУ::ТЕХНИЧЕСКИЕ И ПРИКЛАДНЫЕ НАУКИ. ОТРАСЛИ ЭКОНОМИКИ::Автоматика. Вычислительная техникаru
dc.titleAnalysis of Queueing System with Non-Preemptive Time Limited Service and Impatient Customersru
dc.typearticleru
dc.rights.licenseCC BY 4.0ru
dc.identifier.DOI10.1007/s11009-019-09707-7-
dc.identifier.orcid0000-0003-2881-0227ru
dc.identifier.orcid0000-0002-3903-6444ru
Располагается в коллекциях:Статьи факультета прикладной математики и информатики

Полный текст документа:
Файл Описание РазмерФормат 
s11009-019-09707-7.pdf2,46 MBAdobe PDFОткрыть
Показать базовое описание документа Статистика Google Scholar



Все документы в Электронной библиотеке защищены авторским правом, все права сохранены.