Erlang-C 公式在多服务器极限状态下的一些渐近特性

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Operations Research Letters Pub Date : 2024-05-01 DOI:10.1016/j.orl.2024.107116

Ragavendran Gopalakrishnan , Yueyang Zhong

{"title":"Erlang-C 公式在多服务器极限状态下的一些渐近特性","authors":"Ragavendran Gopalakrishnan , Yueyang Zhong","doi":"10.1016/j.orl.2024.107116","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents asymptotic properties of the Erlang-C formula in a spectrum of many-server limiting regimes. Specifically, we address an important gap in the literature regarding its limiting value in critically loaded regimes by studying extensions of the well-known square-root safety staffing rule used in the Quality-and-Efficiency-Driven (QED) regime.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107116"},"PeriodicalIF":0.8000,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S016763772400052X/pdfft?md5=4eebe7acf63a930d3a0551a1b0e70e7c&pid=1-s2.0-S016763772400052X-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Some asymptotic properties of the Erlang-C formula in many-server limiting regimes\",\"authors\":\"Ragavendran Gopalakrishnan , Yueyang Zhong\",\"doi\":\"10.1016/j.orl.2024.107116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper presents asymptotic properties of the Erlang-C formula in a spectrum of many-server limiting regimes. Specifically, we address an important gap in the literature regarding its limiting value in critically loaded regimes by studying extensions of the well-known square-root safety staffing rule used in the Quality-and-Efficiency-Driven (QED) regime.</p></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"54 \",\"pages\":\"Article 107116\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S016763772400052X/pdfft?md5=4eebe7acf63a930d3a0551a1b0e70e7c&pid=1-s2.0-S016763772400052X-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S016763772400052X\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S016763772400052X","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

本文介绍了 Erlang-C 公式在多服务器极限状态下的渐近特性。具体来说，我们通过研究质量和效率驱动（QED）机制中使用的著名平方根安全人员配置规则的扩展，解决了文献中有关其在临界负载机制中极限值的重要空白。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Some asymptotic properties of the Erlang-C formula in many-server limiting regimes

This paper presents asymptotic properties of the Erlang-C formula in a spectrum of many-server limiting regimes. Specifically, we address an important gap in the literature regarding its limiting value in critically loaded regimes by studying extensions of the well-known square-root safety staffing rule used in the Quality-and-Efficiency-Driven (QED) regime.

求助全文

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

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.