首页 | 本学科首页   官方微博 | 高级检索  
     检索      

具有Min(N,D,V)-策略控制的M/G/1排队系统
引用本文:罗乐,唐应辉.具有Min(N,D,V)-策略控制的M/G/1排队系统[J].运筹学学报,2019,23(2):1-16.
作者姓名:罗乐  唐应辉
作者单位:1. 四川师范大学数学与软件科学学院, 成都 610068;2. 南充职业技术学院, 四川 南充 637000;3. 四川师范大学基础教学学院, 成都 610068
基金项目:国家自然科学基金(No.71571127),国家自然科学青年基金(No.71301111)
摘    要:研究服务员具有多重休假和系统采取Min(N,D,V)-策略控制的M/G/1排队系统,运用全概率分解技术和拉普拉斯变换工具,研究了系统队长的瞬态分布和稳态分布,得到了队长瞬态分布的拉普拉斯变换的表达式和稳态队长分布的递推表达式,同时给出了稳态队长的随机分解结果和附加队长分布的显示表达式.进一步讨论了当N→∞,或D→∞,或p{V=∞}=1,或p{V=0}=1的一些特殊情况.最后,在建立系统费用结构模型的基础上,导出了系统长期单位时间的期望费用的显示表达式,并通过数值实例不但确定了使得系统在长期单位时间内的期望费用最小的联合控制策略(N~*,D~*),而且与单一的最优N~*-控制策略和D~*-控制策略进行了比较.

关 键 词:多重休假  Min(N  D  V)-策略  全概率分解技术  队长分布  最优策略  
收稿时间:2017-09-05

M/G/1 queueing system with Min(N,D,V)- policy control
LUO Le,TANG Yinghui.M/G/1 queueing system with Min(N,D,V)- policy control[J].OR Transactions,2019,23(2):1-16.
Authors:LUO Le  TANG Yinghui
Institution:1. School of Mathematics and Software Science, Sichuan Normal University, Chengdu 610068, China;2. Nanchong Vocational and Technical Collage, Nanchong 637000, Sichuan, China;3. School of Fundamental Education, Sichuan Normal University, Chengdu 610068, China
Abstract:In this paper, we consider the M/G/1 queueing system with multiple server vacations and Min(N,D,V) -policy. By using the total probability decomposition technique and the Laplace transformation tool, the transient queue-length distribution and the steady queue-length distribution are discussed. Both the expressions of the Laplace transformation of the transient queue-length distribution and the recursive expressions of the steady queue-length distribution are obtained. Meanwhile, we present the stochastic decomposition result of the steady queue length and the explicit expression of the additional queue length distribution. Furthermore, some special cases are discussed when N→1, D→1, p{V=∞}=1 or p{V=0}=1. Finally, the explicit expression of the long-run expected cost rate is derived under a given cost structure. And by through numerical calculation, we determine the optimal control policy (N*; D*) for minimizing the long-run expected cost per unit time as well as compare with the single optimal N*-policy and the single optimal D*-policy.
Keywords:multiple server vacation  Min(N  D  V)-policy  total probability decomposition technique  queue length distribution  optimal policy  
本文献已被 CNKI 等数据库收录!
点击此处可从《运筹学学报》浏览原始摘要信息
点击此处可从《运筹学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号