修理设备可更换且修理工多重延误休假的单部件可修系统

假定部件的寿命、修理时间和修理工的休假时间均服从一般连续型分布.修理工的延误休假时间服从指数分布,并且修理设备的寿命服从爱尔朗分布,其更换时间服从一般连续型分布的情况下,研究了修理设备可更换且修理工可多重延误休假的单部件可修系统.通过使用补充变量法、广义马尔可夫过程方法和拉普拉斯变换工具,讨论了系统的瞬时可用度、稳态可用度以及(0,t]时间内系统的平均故障次数和稳态故障频度,得到了系统和修理设备主要可靠性指标的拉普拉斯变换表达式.     

一种新型的N部件串联可修系统及其可靠性分析

本文研究一种Ⅳ部件串联可修系统的一个新模型，该模型在经典。部件串联可修系统中引入了修理工可多重延误休假的概念，并且考虑了修理工使用修理设备在修理失效部件过程中可能因修理设备失效而立即更换修理设备对整个系统可靠性造成的影响,假定修理工的延误休假时间、部件的寿命和修理设备的寿命均服从指数分布，部件的修理时间、修理设备的更换时间和修理工的休假时间均服从一般连续型分布，通过使用补充变量法和广义马尔可夫过程方法得到了系统和修理设备的一些重要可靠性指标．     

修理工带休假的两同型部件冷贮备可修系统

假定部件工作寿命,修理时间和修理工休假时间均服从一般分布,利用马尔可夫骨架过程理论,研究了修理工带休假的两同型部件冷贮备可修系统的可靠性。     

离散时间单重休假两部件并联可修系统的可靠性分析

利用离散向量Markov过程方法研究了离散时间单重休假两同型部件并联可修系统.在部件寿命服从几何分布,修理时间和修理工休假时间服从一般离散型概率分布的假定下,引入修理时间和休假时间尾概率,求得了系统的稳态可用度、稳态故障频度、待修概率、修理工空闲概率和休假概率,以及首次故障前平均时间等可靠性指标.并通过具体数值实例展示了离散向量马氏链状态转移频度的具体计算方法.     

具有单重休假和修复不如新的两部件并联系统

为了解决由"修复非新"部件组成的具有休假的可修型系统,运用几何过程理论、补充变量法和拉普拉斯变换工具,研究了由两个不同型部件和一个修理工组成的可修型并联系统.假设两个部件的工作寿命和修理时间均服从不同的指数分布,修理工可休假,对部件1的修理是几何修理而对部件2的修理则是修复如新,得到了系统的可用度、可靠度和系统首次故障前平均时间等可靠性指标.成果具有一定的理论和实际意义.     

修理工可多重休假的n部件串联可修系统可靠性分析

本文把修理工多重休假的概念引入ｎ部件串联可修系统。假定休假时间和每个部件的修理时间为一般连续型随机变量，每个部件的失效分布为负指数分布。利用向量Ｍａｒｋｏｖ过程方法，求出了该系统的可靠性指标。     

修理工单重休假且不能修复如新的冷储备可修系统

研究两个同型部件和一个修理工组成的冷储备系统.假定部件的寿命和修理时间均为指数分布,修理工可以休假且部件不能修复如新,利用几何过程和补充变量法得到系统的可用度和可靠度,以及修理工处于休假和空闲的概率等一些可靠性指标.     

专职修理工多重休假且修理设备可更换的k/n(G)表决系统研究

讨论专职修理工多重休假,修理设备可发生失效且可更换的k/n(G)表决可修系统.当系统中没有故障部件时,专职修理工开始一次休假,在此期间,若有工作部件发生故障,则立即指派普通修理工修理故障部件,一直持续到系统中无故障部件或专职修理工休假回来.利用马尔可夫过程理论和矩阵解法,给出了系统瞬态和稳态下的可用度和故障频度、可靠度、系统首次故障前的平均时间、修理设备处于更换状态的概率等指标的表达式.在此基础上,基于不同的初始条件研究了相关指标随时间的变化情况.最后,特殊情形的讨论验证了所得结果的正确性.     

基于几何过程和位相分布休假的两部件并联可修系统的可靠性分析

主要以两不同型部件组成的并联可修系统为研究对象.在系统对失效相位存在记忆的基础上,考虑了修理工可单重休假且休假时间服从位相(PH)分布.每个工作部件均有可能因受到两种不同类型的故障而失效,且均"修复非新".在假定部件的工作时间,修理时间分别服从PH分布的几何过程和负指数分布的条件下,利用马尔可夫过程和矩阵分析的方法,对可修系统进行了可靠性分析,并给出了相应可靠性指标的数值算例.     

专职修理工多重休假且修理设备可更换的k/n(G)表决系统研究

讨论专职修理工多重休假,修理设备可发生失效且可更换的k/n（G）表决可修系统.当系统中没有故障部件时,专职修理工开始一次休假,在此期间,若有工作部件发生故障,则立即指派普通修理工修理故障部件,一直持续到系统中无故障部件或专职修理工休假回来.利用马尔可夫过程理论和矩阵解法,给出了系统瞬态和稳态下的可用度和故障频度、可靠度、系统首次故障前的平均时间、修理设备处于更换状态的概率等指标的表达式.在此基础上,基于不同的初始条件研究了相关指标随时间的变化情况.最后,特殊情形的讨论验证了所得结果的正确性.     

Stationary Distributions of GI/M/c Queue with PH Type Vacations

We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies.     

Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations

This paper treats the discrete time Geometric/G/1 system with vacations. In this system, after serving all customers in the system, the server will take a random maximum number of vacations before returning to the service mode. The stochastic decomposition property of steady-state queue length and waiting time has been proven. The busy period, vacation mode period, and service mode period distributions are also derived. Several common vacation policies are special cases of the vacation policy presented in this study.     

The Discrete-Time GI/Geo/1 Queue with Multiple Vacations

We study a discrete-time GI/Geo/1 queue with server vacations. In this queueing system, the server takes vacations when the system does not have any waiting customers at a service completion instant or a vacation completion instant. This type of discrete-time queueing model has potential applications in computer or telecommunication network systems. Using matrix-geometric method, we obtain the explicit expressions for the stationary distributions of queue length and waiting time and demonstrate the conditional stochastic decomposition property of the queue length and waiting time in this system.     

具有不耐烦顾客和多重工作休假的排队库存系统

研究具有不耐烦顾客和多重工作休假的M/M/1/N排队库存系统模型,分别考虑了系统中库存为零时服务员休假和系统中顾客数为零时服务员休假两种休假方式,基于(s,S)库存策略,运用矩阵迭代方法得到了系统稳态概率分布,并给出系统相关性能指标,进而建立系统平均库存费用函数.通过数值算例对比分析了两种休假方式下的系统主要参数变化对系统重要性能指标的影响,并在最优费用的层面对两个模型的优劣进行了对比分析.     

GI/M/1 Queue with Server Vacations

A queueing model with server vacations is studied in which it is assumed that the interarrival time has a general distribution, the service-time distribution is exponential and vacations are independently and indentically distributed with a general distribution. Using the embedded Markov chain technique, the equilibrium probability distributions of system size have been obtained at pre-arrival and at random epochs separately. Finally, the distribution of waiting time of a customer in the queue (excluding service) has been derived.     

带RCE抵消策略的负顾客M/M/1工作休假排队系统

考虑服务员在休假期间不是完全停止工作,而是以相对于正常工作时低些的速率服务顾客的M/M/1工作休假排队模型.在此模型基础上,笔者针对现实的M/M/1排队模型中可能出现的外来干扰因素,提出了带RCE(Removal of Customers at the End)抵消策略的负顾客M/M/1工作休假排队这一新的模型.服务规则为先到先服务.工作休假策略为空竭服务多重工作休假.抵消原则为负顾客一对一抵消队尾的正顾客,若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.使用拟生灭过程和矩阵几何解方法给出了系统队长的稳态分布,证明了系统队长和等待时间的随机分解结果并给出稳态下系统中正顾客的平均队长和顾客在系统中的平均等待时间.     

推广的多重休假$M^X/G/1$排队系统

在平稳状态下,Baba利用补充变量方法研究了多重休假的MX/G/1排队,但作者假定了休假时间和服务时间都有概率密度函数.本文考虑推广的多重休假MX/G/1排队,在假定休假时间和服务时间都是一般概率分布函数下,我们研究了队长的瞬态和稳态性质.通过引进"服务员忙期"和使用不同于Baba文中使用的分析技术,我们导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解.特别地,通过本文可直接获得多重休假的M/G/1与标准的MX/G/1排队系统相应的结果.     

An Arrival Time Approach to M/G/1-type Queues with Generalized Vacations

We propose a simple way, called the arrival time approach, of finding the queue length distributions for M/G/1-type queues with generalized server vacations. The proposed approach serves as a useful alternative to understanding complicated queueing processes such as priority queues with server vacations and MAP/G/1 queues with server vacations.     

The queue length distributions in the finite buffer bulk-service MAP/G/1 queue with multiple vacations

We consider a finite buffer batch service queueing system with multiple vacations wherein the input process is Markovian arrival process (MAP). The server leaves for a vacation as soon as the system empties and is allowed to take repeated (multiple) vacations. The service- and vacation- times are arbitrarily distributed. We obtain the queue length distributions at service completion, vacation termination, departure, arbitrary and pre-arrival epochs. Finally, some performance measures such as loss probability, average queue lengths are discussed. Computational procedure has been given when the service- and vacation- time distributions are of phase type (PH-distribution).     

Reliability analysis for the consecutive-k-out-of-n: F system with repairmen taking multiple vacations

Commonly studied models of the consecutive-k-out-of-n: F repairable systems in the existing literatures were considering the systems which had one repairman without vacation or infinite repairmen without vacations. In addition to those models, multiple repairmen without vacations are studied occasionally. However, technical personnel are very short in some fields. Some failed components cannot be repaired in time. This paper deals with the phenomenon of waiting for repair by supposing R repairmen with multiple vacations in the system. Using the pairs (i, |j|), the factor that the R repairmen taking multiple vacations was embedded into the classical C(k, n: F) system. Reliability indexes are presented. Finally, the Runge–Kutta method was used to a special case, and the experimental results demonstrate the necessity and validity of the new model.