串联系统的可靠性

本文利用侯振挺等人提出的马尔可夫骨架过程理论讨论了串联系统的改进模型的可靠性.     

启动时间的GI／G／1排队系统的非平衡理论

本文利用侯振挺等提出的马尔可夫骨架过程理论讨论了启动时间的GI/G/I排队系统，得到了此系统到达过程，队长，及等待时间的概率分布/     

M/M/m/m防空系统射击效能的排队概率特性

研究了具有消失制的M/M/m/m防空系统的射击效能,利用排队论及随机运筹学的有关知识,在模型的条件与假设下给出了其平稳状态的队长的分布律πk,平均工作的防空武器数E,敌机的突防概率πm,忙期长度等指标.     

一类批量服务排队系统的求解

给出一类特殊的批量服务排队系统-公交系统的稳态概率分布的求解过程,并在此基础上给出这类服务系统平均队长的算法,中给出具体例子说明计算过程。     

N级串联休假反馈开排队系统模型

主要研究了具有反馈的多级串联休假开排队模型,其中采用递推方式给出了马尔可夫过程的转移矩阵,并利用矩阵分析方法进行求解,得到了该系统的稳态解及其它相关指标.     

匹配排队网络的忙期

本文考虑了匹配排队网络ＰＨ／Ｍ／ｃ→ｏＰＨ／１,研究了两个子系统和整个网络的忙期与非闲期的概率分布,得到了具有一致误差的算法。,然后证明了这些算法的时间与空间的计算复杂性都是多项式的．最后给出了数例。     

有阻塞的多级串联排队系统分析

对串联排队系统的应用及研究现状见文[1]，至今对它的研究一般仅限于两级．本文研究有N级，且每级容量都有限（因此会出现堵塞）的串联排队系统，首次技巧性地应用马尔可夫过程的状态空间，Q矩阵及解的表达等一系列的递推表示方法，得到了该系统的队长、忙期、逗留时间等分布的简明精确显式解．由于矩阵及递推的运算在计算机上容易实现，因此本文结论便于应用．     

GI／G／1排队系统的队长的瞬时性态（I）

本文用三种方式给出计算队长L(t)的瞬时分布。     

Diffusion approximation to a queueing system with time-dependent arrival and service rates

A time nonhomogeneous diffusion approximation to a single server-single queue service system is obtained. Under various assumptions on the time-dependent functions appearing in the infinitesimal moments, transient and steady-state behaviour are analyzed. In particular, a diffusion approximation characterized by space-linear and time-varying moments is studied. The density of the busy period and the probability for the busy period to terminate are obtained. Finally, estimates of the goodness of the diffusion approximation are given.     

On series by Haar system

The paper considers the series by Haar system \(\sum\limits_{n = 1}^\infty {a_n \chi _n (x)} \), satisfying the conditions \(\sum\limits_{n = 1}^\infty {a_n^2 \chi _n^2 (x)} = \infty \) and a _n χ _n (x) → 0 almost everywhere. Some theorems about correcting a function on sets of arbitrarily small measures are proved.     

空竭服务单重休假的MMPP(2)/G/1植物病虫害防治系统的效能

研究了空竭服务、单重休假的MMPP(2)/G/1植物病虫害防治系统模型的效能,并利用排队论及随机运筹学的有关知识,在模型的条件与假设下给出了模型的平稳条件、平均忙期长度,以及在忙期内防治完的害虫数等性能指标.     

An exact formula for the mean number of claims served by a one-channel queuing system with rejections on a given time interval

An exact formula for the mean number of claims served by a one-channel queuing system (QS) with rejections on a given time interval is obtained, which makes it possible, in particular, to calculate exactly the QS efficiency indexes on an arbitrary time interval.     

On the M/M/1 Queue with Catastrophes and Its Continuous Approximation

For the M/M/1 queue in the presence of catastrophes the transition probabilities, densities of the busy period and of the catastrophe waiting time are determined. A heavy-traffic approximation to this discrete model is then derived. This is seen to be equivalent to a Wiener process subject to randomly occurring jumps for which some analytical results are obtained. The goodness of the approximation is discussed by comparing the closed-form solutions obtained for the continuous process with those obtained for the M/M/1 catastrophized queue.     

Transient solution for a finite capacity M/G a,b /1 queueing system with vacations to the server

In this paper we consider a single server queueing system with Poisson input, general service and a waiting room that allows only a maximum of b customers to wait at any time. A minimum of a customers are required to start a service and the server goes for a vacation whenever he finds less than a customers in the waiting room after a service. If the server returns from a vacation to find less than a customers waiting, he begins another vacation immediately. Using the theory of regenerative processes we derive expressions for the time dependent system size probabilities at arbitrary epochs.     

A queueing system with random server capacity and multiple control

The authors study queueing, input and output processes in a queueing system with bulk service and state dependent service delay. The input flow of customers, modulated by a semi-Markov process, is served by a single server that takes batches of a certain fixed size if available or waits until the queue accumulates enough customers for service. In the latter case, the batch taken for service is of random size dependent on the state of the system, while service duration depends both on the state of the system and on the batch size taken. The authors establish a necessary and sufficient condition for equilibrium of the system and obtain the following results: Explicit formulas for steady state distribution of the queueing process, intensity of the input and output processes, and mean values of idle and busy periods. They employ theory of semi-regenerative processes and illustrate the results by a number of examples. In one of them an optimization problem is discussed.     

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.