ASIA unversity:Item 310904400/18322
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21696423      在线人数 : 936
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 管理學院 > 經營管理學系  > 期刊論文 >  Item 310904400/18322


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/18322


    题名: Analytical Method for Accuracy Analysis of the Randomized T-plocy Queue
    作者: 王國雄;Wang, Kuo-Hsiunh;Dong-Yuh Yang;W. L. Pearn
    贡献者: 經營管理學系
    关键词: Accuracy comparison;Maximum entropy;Sever breakdowns;Second optional service;Startup;(T, p)-policy
    日期: 2012-03
    上传时间: 2012-11-26 04:47:12 (UTC+0)
    摘要: We consider a randomized policy to control the M/G/1 queueing system with an unreliable server, second optional service and general startup times. The server is subject to breaking down according to a Poisson process, and the repair time obeys a general distribution. All arrived customers demand the first required service, and only some of the arrived customers demand the second optional service. After all the customers are served in the system, the server immediately takes a vacation and operates the (T, p)-policy. For this queueing system, we employ maximum entropy approach with several constraints to develop the probability distributions of the system size and the expected waiting time in the queue. Based on the accuracy comparison between the exact and approximate methods, we show that the maximum entropy approach is quite accurate for practical purpose, which is a useful method for solving complex queueing systems.
    關聯: International Journal of Innovative Computing Information and Control,8(3A),1717–1730.
    显示于类别:[經營管理學系 ] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML577检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈