{"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}
引用次数: 2
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.
期刊介绍:
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.