对服务时间呈二郎分布的不可补队列的详细分析

IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-03-07 DOI:10.3103/S0146411624010024

Alexander M. Andronov, Kristina Mahareva

{"title":"对服务时间呈二郎分布的不可补队列的详细分析","authors":"Alexander M. Andronov, Kristina Mahareva","doi":"10.3103/S0146411624010024","DOIUrl":null,"url":null,"abstract":"The present paper considers a service system without the input flow of claims, that is, all claims are present in the queue initially from the beginning. The number of such claims equals Θmax, whereas the number of servers equals k. The time of one service has the Erlang distribution. The paper aims to calculate the time distribution until the completion of all services, as well as the average waiting time of one claim.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 1","pages":"1 - 10"},"PeriodicalIF":0.6000,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Elaborated Analysis of a Nonreplenishable Queue with Erlang Distribution of the Service Time\",\"authors\":\"Alexander M. Andronov, Kristina Mahareva\",\"doi\":\"10.3103/S0146411624010024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The present paper considers a service system without the input flow of claims, that is, all claims are present in the queue initially from the beginning. The number of such claims equals Θmax, whereas the number of servers equals k. The time of one service has the Erlang distribution. The paper aims to calculate the time distribution until the completion of all services, as well as the average waiting time of one claim.\",\"PeriodicalId\":46238,\"journal\":{\"name\":\"AUTOMATIC CONTROL AND COMPUTER SCIENCES\",\"volume\":\"58 1\",\"pages\":\"1 - 10\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC CONTROL AND COMPUTER SCIENCES\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0146411624010024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0146411624010024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

摘要-本文考虑的是一个没有请求输入流的服务系统，即所有请求从一开始就存在于队列中。一次服务的时间呈厄朗分布。本文旨在计算所有服务完成前的时间分布，以及一个申请的平均等待时间。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Elaborated Analysis of a Nonreplenishable Queue with Erlang Distribution of the Service Time

查看原文本刊更多论文

Elaborated Analysis of a Nonreplenishable Queue with Erlang Distribution of the Service Time

The present paper considers a service system without the input flow of claims, that is, all claims are present in the queue initially from the beginning. The number of such claims equals Θmax, whereas the number of servers equals k. The time of one service has the Erlang distribution. The paper aims to calculate the time distribution until the completion of all services, as well as the average waiting time of one claim.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

AUTOMATIC CONTROL AND COMPUTER SCIENCES AUTOMATION & CONTROL SYSTEMS-

CiteScore

1.70

自引率

22.20%

发文量

期刊介绍： Automatic Control and Computer Sciences is a peer reviewed journal that publishes articles on• Control systems, cyber-physical system, real-time systems, robotics, smart sensors, embedded intelligence • Network information technologies, information security, statistical methods of data processing, distributed artificial intelligence, complex systems modeling, knowledge representation, processing and management • Signal and image processing, machine learning, machine perception, computer vision