多重工作休假的Geom/Geom/(Geom/Geom)/H双输入排队系统

本文研究多重工作休假的Geom/Geom/(Geom/Geom)/H双输入排队的问题.利用Markov链及矩阵几何解的方法,获得所研究的模型,建立稳态概率满足的方程组,进而推导出稳态队长分布、服务台消失的概率,推广了排队系统的模型及相关的结果.     

带启动时间的Geom/Geom/1多重工作休假排队

本文中研究了一个带有启动时间的Geom/Geom/1多重工作休假排队模型。服务台在休假期间,不停止服务,而是以较低的服务率为顾客提供服务。运用拟生灭过程和矩阵几何解的方法,给出了该模型的稳态队长分布,并求出了平均队长以及顾客的平均逗留时间。     

N策略带启动时间的Geom/Geom/1工作休假排队

考虑N策略带启动时间的Geom/Geom/1工作休假排队,服务员在休假期间并未完全停止工作而是以较低的速率为顾客服务.运用拟生灭链和矩阵几何解方法,给出了该模型的稳态队长的分布和等待时间的概率母函数,并证明了队长和等待时间的条件随机分解结构.     

带负顾客且具有Bernoulli反馈的Geom/Geom/1休假排队

研究带有反馈的具有正、负两类顾客的Geom/Geom/1离散时间休假排队模型.休假排队策略为单重休假,其中负顾客不接受服务,只起一对一抵消队首正在接受服务的顾客作用.完成服务的正顾客以概率σ(0≤σ≤1)等待下次服务,以概率σ离开系统.运用拟生灭过程和矩阵几何解方法得到队长的稳态分布的存在条件和表达式,进而求出系统队长稳态分布的随机分解.此外,我们利用了数值例子进一步反映参数对平均队长的影响.     

带有启动时间单重休假的Geom/G/1排队

本研究带有启动时间的单重休假Geom/G/1离散时间排队，导出了稳态队长、等待时间的分布和母函数及其随机分解结果和稳态系统忙期的分析。     

多重休假的带启动期Geom/G/1排队

本文研究多重休假的带启动期的Geom/G/1离散时间排队。给出稳态队长，等待时间分布的母函数及其随机分解结果，推导出忙期，假期和启动期的母函数等。     

基于仿真实验的休假Geom/G/1排队的性能分析

基于Matlab程序研究了带启动期的多重休假Geom/G/1排队系统,统计出系统的平均队长、顾客的平均等待时间及系统的状态概率等性能指标随系统参数的变化趋势,并与理论分析结果进行有效的对比.从而验证了已知文献理论分析结果的正确性.     

多级适应性休假$M^X/G/1$排队系统的队长分布

考虑多级适应性休假的MX/G/1排队系统.采用一种较简单的分析方法,讨论了队长分布的瞬态和稳态性质,得到了队长瞬态分布的拉普拉斯变换的递推表达式和稳态分布的递推表达式,以及稳态队长的随机分解,并给出了服务台闲期、服务台忙循环期的分布函数.另外,从讨论中直接导出了一些特殊排队模型的相应指标.     

单重休假闸门服务的Geom/G/1离散时间排队系统

文章研究了单重休假的Geom/G/1闸门服务系统,推导出稳态下系统队长的母函数,FCFS规则下的等待时间的母函数,使用离散时间队长和剩余工作量的分解性质,求出剩余工作量的母函数,最后给出服务周期的性能指标的母函数,及系统处在各种状态的概率.     

多重休假的带启动--关闭期的Geom/G/1排队

本研究多重休假的带启动——关闭期的Geom／G／1离散时间排队，给出稳态队长，等待时间分布的母函数及其随机分解结果，推导出忙期的全假期的母函数，给出该模型的几个特例。     

The discrete time Geom/Geom/1 queue with multiple working vacations

In this paper, we study a discrete time Geom/Geom/1 queue with multiple working vacations. Using the quasi birth and death chain and matrix-geometric solution method, we give distributions for the number of customers in system and the waiting time of a customer and their stochastic decomposition structures, and obtain distributions of the additional number of customers and additional delay. Furthermore, we derive the formulae of expected regular busy period and expected busy cycle. Finally, by numerical examples, we analyze the effect of the parameters on the expected queue length and sojourn time.     

带负顾客启动期N策略的Geom/Geom/1工作休假排队

将带RCH抵消策略的负顾客、启动期和N策略引入离散时间排队.休假策略为空竭服务多重工作休假.负顾客一对一抵消队首正在接受服务的正顾客,若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.利用拟生灭过程和矩阵几何解方法,给出了稳态队长分布及其随机分解.通过数值例子表现了启动率和负顾客到达率对稳态队长的影响.     

带启动时间的多级适应性休假的Geom/G/1排队

本文研究带启动时间的多级适应性Geom／G／1离散时间排队．给出稳态队长和等待时间分布的母函数及其随机分解结果，推导出忙期和全假期的母函数和均值。     

多重休假的带启动期的Geom/G/1排队的PH封闭性

本是在献[1]的基础上，研究多重休假的带启动期的Geom／G／1离散时间排队的附加队长、附加延迟的PH封闭性。     

On a BMAP/G/1 G-queue with setup times and multiple vacations

In this paper, we consider a BMAP/G/1 G-queue with setup times and multiple vacations. Arrivals of positive customers and negative customers follow a batch Markovian arrival process (BMAP) and Markovian arrival process (MAP) respectively. The arrival of a negative customer removes all the customers in the system when the server is working. The server leaves for a vacation as soon as the system empties and is allowed to take repeated (multiple) vacations. By using the supplementary variables method and the censoring technique, we obtain the queue length distributions. We also obtain the mean of the busy period based on the renewal theory.     

The age of the arrival process in the G/M/1 and M/G/1 queues

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit expressions for the conditional density functions, as well as some stochastic orders, in all three cases are given. Moreover, we show that this independence property, which we prove by elementary arguments, also leads to an alternative proof for the fact that given a busy server, the number of customers in the queue follows a geometric distribution. We conclude with a derivation for the Laplace Stieltjes Transform (LST) of the age of the inter-arrival time in the M/G/1 queue.     

A Recursive Algorithm for State Dependent GI/M/1/N Queue with Bernoulli-Schedule Vacation

In this paper, we study a renewal input working vacations queue with state dependent services and Bernoulli-schedule vacations. The model is analyzed with single and multiple working vacations. The server goes for exponential working vacation whenever the queue is empty and the vacation rate is state dependent. At the instant of a service completion, the vacation is interrupted and the server resumes a regular busy period with probability 1???q (if there are customers in the queue), or continues the vacation with probability q (0?≤?q?≤?1). We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. Finally, using some numerical results, we present the parameter effect on the various performance measures.