{"title":"Analysis of a Single Server Retrial Queueing System with Finite Capacity, F-Policy, Balking, Reneging and Server Maintenance","authors":"R. Jeyachandhiran, P. Rajendran","doi":"10.37256/cm.5120243745","DOIUrl":null,"url":null,"abstract":"In this paper, we determine a single server retrial queuing system with finite capacity, F-policy, balking, reneging and server maintenance. The arriving customer when notices the server becomes free, then they get service immediately. In case server becomes busy, the customers are move to either orbit or may balk the system. In the orbit, after some random time the customer repeats their attempts for service. The customers are waiting in the orbit for longer time become impatient and leaves the orbit without getting service. Once the number of customers in the orbit reaches its full capacity then the arrival of customer is not allowed to enter into the orbit. The new customer is allowed into the orbit when the F-policy level is reached. If no more customer in the orbit, server will move to the vacation. By using recursive technique, the steady state distributions are obtained and we have developed various performance measures.","PeriodicalId":504505,"journal":{"name":"Contemporary Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Contemporary Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37256/cm.5120243745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we determine a single server retrial queuing system with finite capacity, F-policy, balking, reneging and server maintenance. The arriving customer when notices the server becomes free, then they get service immediately. In case server becomes busy, the customers are move to either orbit or may balk the system. In the orbit, after some random time the customer repeats their attempts for service. The customers are waiting in the orbit for longer time become impatient and leaves the orbit without getting service. Once the number of customers in the orbit reaches its full capacity then the arrival of customer is not allowed to enter into the orbit. The new customer is allowed into the orbit when the F-policy level is reached. If no more customer in the orbit, server will move to the vacation. By using recursive technique, the steady state distributions are obtained and we have developed various performance measures.
本文确定了一个具有有限容量、F 策略、逡巡、背弃和服务器维护的单服务器重试排队系统。当发现服务器空闲时,到达的客户会立即得到服务。如果服务器繁忙,客户会被转移到轨道或逡巡系统。在轨道上,经过一段时间后,客户会重复尝试服务。在轨道上等待时间较长的客户会变得不耐烦,并在没有得到服务的情况下离开轨道。一旦轨道中的客户数量达到饱和,就不允许新客户进入轨道。当达到 F 政策水平时,新客户将被允许进入轨道。如果轨道上不再有客户,服务器将转入休假状态。通过使用递归技术,我们获得了稳态分布,并制定了各种性能指标。