多重假期中以概率p进入的M/G/1可修排队系统  

M/G/1 repairable queueing system with p-entering discipline during server vacations

作　　者：刘云颇[1,2] 唐应辉[1] 

机构地区：[1]四川师范大学数学与软件科学院,四川成都610066 [2]成都大学信息科学与技术学院,四川成都610031

出　　处：《系统工程学报》2011年第5期718-724,共7页Journal of Systems Engineering

基　　金：国家自然科学基金资助项目(70871084);教育部高校博士点专项基金资助项目(200806360001)

摘　　要：考虑在服务员假期中到达的顾客以概率p(0<p≤1)进入系统的多重休假M/G/1可修排队系统,运用全概率分解技术和拉普拉斯变换,研究了服务台的下列可靠性指标:1)首次失效前的寿命分布;2)瞬时不可用度和稳态不可用度;3)在(0,t]时间内的平均失效次数.获得了服务台一系列的可靠性结果.This paper considers a M/G/1 repairable queueing system with multiple server vacations in which the customers who arrive during server vacation enter the system with probability p（0 〈 p≤ 1）. By using the total probability decomposition method and Laplace transform, the following reliability indices of the service station are discussed： 1） The probability distribution of the first failure time; 2） The point-wise unavailability and the stead-state unavailability; 3） The expected failure number during a given （0, t）. Some reliability results of the service station are obtained.

关 键 词：多重休假 p-进入规则 可修排队系统 不可用度 失效次数 

分 类 号：O213.2[理学—概率论与数理统计] O226[理学—数学]