Logo BSU

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот документ: https://elib.bsu.by/handle/123456789/341581
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorShajin, D.-
dc.contributor.authorDudina, A.N.-
dc.contributor.authorDudina, O.-
dc.contributor.authorKrishnamoorthy, A.-
dc.date.accessioned2026-02-13T11:54:32Z-
dc.date.available2026-02-13T11:54:32Z-
dc.date.issued2020-
dc.identifier.citationJournal of Industrial and Management Optimization.2020;Vol. 16(6): P. 2891-2912.ru
dc.identifier.urihttps://elib.bsu.by/handle/123456789/341581-
dc.description.abstractIn this paper, we study a priority queueing-inventory problem with two types of customers. Arrival of customers follows Marked Markovian arrival process and service times have phase-type distribution with parameters depending on the type of customer in service. For service of each type of customer, a certain number of additional items are needed. High priority customers do not have waiting space and so leave the system when on their arrival a priority 1 customer is in service or the number of available additional items is less than the required threshold. Preemptive priority is assumed. Type 2 customers, encountering a busy server or idle with the number of available additional items less than a threshold, go to an orbit of infinite capacity to retry for service. The customers in orbit are non-persistent: if on retrial the server is found to be busy/idle with the number of additional items less than the threshold, this customer abandons the system with certain probability. Such a system represents an accurate enough model of many real-world systems, including wireless sensor networks and system of cognitive radio with energy harvesting and healthcare systems. The probability distribution of the system states is computed, using which several of the characteristics are derived. A detailed numerical study of the system, including the analysis of the influence of the threshold, is performed.ru
dc.language.isoenru
dc.publisherAmerican Institute of Mathematical Sciencesru
dc.rightsinfo:eu-repo/semantics/openAccessru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетикаru
dc.titleA two-priority single server retrial queue with additional itemsru
dc.typearticleru
dc.rights.licenseCC BY 4.0ru
dc.identifier.DOI10.3934/jimo.2019085-
Располагается в коллекциях:Статьи факультета прикладной математики и информатики

Полный текст документа:
Файл Описание РазмерФормат 
Дудин2.pdf541,77 kBAdobe PDFОткрыть
Показать базовое описание документа Статистика Google Scholar



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