具有第二可选服务和服务器故障的M/G/1队列的前两矩熵最大化方法

Q3 Business, Management and Accounting
Dong-Yuh Yang, Kuo-Hsiung Wang, W. Pearn
{"title":"具有第二可选服务和服务器故障的M/G/1队列的前两矩熵最大化方法","authors":"Dong-Yuh Yang, Kuo-Hsiung Wang, W. Pearn","doi":"10.1504/IJSOI.2011.045561","DOIUrl":null,"url":null,"abstract":"We consider the M/G/1 queue with second optional service and server breakdowns. A customer leaves the system either after the first required service with probability (1 – θ ) or immediately goes for a second optional service with probability θ after the completion of the first required service. For this queueing model, it is rather difficult to obtain the steady-sate probability explicitly. We apply the maximum entropy approach to approximate the system size distributions by using the first and second moments of the system size. Accuracy comparisons between the two approximate solutions are conducted. Numerical results indicate that using the first moment approach is more accurate than using the second moment approach.","PeriodicalId":35046,"journal":{"name":"International Journal of Services Operations and Informatics","volume":"6 1","pages":"310"},"PeriodicalIF":0.0000,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJSOI.2011.045561","citationCount":"2","resultStr":"{\"title\":\"First two moment entropy maximisation approach for M/G/1 queues with second optional service and server breakdowns\",\"authors\":\"Dong-Yuh Yang, Kuo-Hsiung Wang, W. Pearn\",\"doi\":\"10.1504/IJSOI.2011.045561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the M/G/1 queue with second optional service and server breakdowns. A customer leaves the system either after the first required service with probability (1 – θ ) or immediately goes for a second optional service with probability θ after the completion of the first required service. For this queueing model, it is rather difficult to obtain the steady-sate probability explicitly. We apply the maximum entropy approach to approximate the system size distributions by using the first and second moments of the system size. Accuracy comparisons between the two approximate solutions are conducted. Numerical results indicate that using the first moment approach is more accurate than using the second moment approach.\",\"PeriodicalId\":35046,\"journal\":{\"name\":\"International Journal of Services Operations and Informatics\",\"volume\":\"6 1\",\"pages\":\"310\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1504/IJSOI.2011.045561\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Services Operations and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJSOI.2011.045561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Business, Management and Accounting\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Services Operations and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSOI.2011.045561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
引用次数: 2

摘要

我们考虑具有第二个可选服务和服务器故障的M/G/1队列。客户要么在完成第一次所需服务后(概率为1 - θ)离开系统,要么在完成第一次所需服务后立即选择第二次可选服务(概率为θ)。对于这种排队模型,要显式地求得稳态安全概率是相当困难的。我们应用最大熵方法通过使用系统大小的第一和第二矩来近似系统大小分布。对两种近似解的精度进行了比较。数值结果表明,一阶矩法比二阶矩法精度更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
First two moment entropy maximisation approach for M/G/1 queues with second optional service and server breakdowns
We consider the M/G/1 queue with second optional service and server breakdowns. A customer leaves the system either after the first required service with probability (1 – θ ) or immediately goes for a second optional service with probability θ after the completion of the first required service. For this queueing model, it is rather difficult to obtain the steady-sate probability explicitly. We apply the maximum entropy approach to approximate the system size distributions by using the first and second moments of the system size. Accuracy comparisons between the two approximate solutions are conducted. Numerical results indicate that using the first moment approach is more accurate than using the second moment approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Services Operations and Informatics
International Journal of Services Operations and Informatics Business, Management and Accounting-Management Information Systems
CiteScore
1.60
自引率
0.00%
发文量
9
期刊介绍: The advances in distributed computing and networks make it possible to link people, heterogeneous service providers and physically isolated services efficiently and cost-effectively. As the economic dynamics and the complexity of service operations continue to increase, it becomes a critical challenge to leverage information technology in achieving world-class quality and productivity in the production and delivery of physical goods and services. The IJSOI, a fully refereed journal, provides the primary forum for both academic and industry researchers and practitioners to propose and foster discussion on state-of-the-art research and development in the areas of service operations and the role of informatics towards improving their efficiency and competitiveness.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信