An M/G/1 Queueing System with Delay Server Vacations

ＡｎＭ／Ｇ／１ＱｕｅｕｅｉｎｇＳｙｓｔｅｍｗｉｔｈＤｅｌａｙＳｅｒｖｅｒＶａｃａｔｉｏｎｓ⒇ＴＡＮＧＹｉｎｇｈｕｉＴＡＮＧＸｉａｏｗｏ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈ．,Ｍａｎａｇｅｍｅｎｔｃｏｌｅｇｅ,Ｕｎｉｖｅｒ．ｏｆＥｌｅｃｔｒ...     

The M/M/1 queue with working vacations and vacation interruptions

In this paper, we study the M/M/1 queue with working vacations and vacation interruptions. The working vacation is introduced recently, during which the server can still provide service on the original ongoing work at a lower rate. Meanwhile, we introduce a new policy：, the server can come back from the vacation to the normal working level once some indices of the system, such as the number of customers, achieve a certain value in the vacation period. The server may come back from the vacation without completing the vacation. Such policy is called vacation interruption. We connect the above mentioned two policies and assume that if there are customers in the system after a service completion during the vacation period, the server will come back to the normal working level. In terms of the quasi birth and death process and matrix-geometric solution method, we obtain the distributions and the stochastic decomposition structures for the number of customers and the waiting time and provide some indices of systems.     

间歇反应过程的智能控制系统

本文为间歇反应过程的智能控制系统提出了一种框架，对其中各部分作了详细分析。并由此抽象出来，为一般性的智能控制系统建立了基本概念和结构模型。     

The bulk input M[X] /M/1 queue with working vacations

In this paper, we analyze a bulk input M^[X] /M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matrix analysis method, highly complicated probability generating function(PGF) of the stationary queue length is firstly derived, from which we got the stochastic decomposition result for the stationary queue length which indicates the evident relationship with that of the classical M^[X] /M/1 queue without vacation. It is important that we find the upper and the lower bounds of the stationary waiting time in the Laplace transform order using the properties of the conditional Erlang distribution. Furthermore, we gain the mean queue length and the upper and the lower bounds of the mean waiting time.     

The M/PH/1 queue with working vacations and vacation interruption

We study an M/PH/1 queue with phase type working vacation and vacation interruption where the vacation time follows a phase type distribution. The server serves the customers at a lower rate in a vacation period. The server comes back to the regular busy period at a service completion without completing the vacation. Such policy is called vacation interruption. In terms of quasi birth and death process and matrix-geometric solution method, we obtain the stationary queue length distribution. Moreover we obtain the conditional stochastic decomposition structures of queue length and waiting time when the service time distribution in the regular busy period is exponential.     

弹性需求下铁路票价和提速策略的优化模型

对于铁路客票定价和提速问题．传统的研究一般都只是考虑票价或者速度一个因素．很少考虑两者之间的影响，以及它们对旅客流量的影响。本文在分析了铁路旅客票价和列车运行速度的经济效益的基础上．给出了一个双层规划模型来描述弹性需求下城市间多种交通运输方式竞争条件下旅客票价和线路提速策略的优化模型，同时给出了该模型的具体算法。通过对算例结果的分析，用该算法求解双层规划模型是可行性，这为合理制定铁路客票价格问题提供了一种方法。     

Some New Results for M/G/1 and GI/G/1 Queues

ＳｏｍｅＮｅｗＲｅｓｕｌｔｓｆｏｒＭ／Ｇ／１ａｎｄＧＩ／Ｇ／１ＱｕｅｕｅｓＴＡＮＧＹｉｎｇｈｕｉ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＵｎｉｖｅｒｓｉｔｙｏｆＥｌｅｃｔｒｏｎｉｃＳｃｉｅｎｃｅａｎｄＴｅｃｈｎｏｌｏｇｙｏｆＣ...     

Optimal control of an M/G/1 retrial queue with vacations

In this note, we consider an M/G/1 retrial queue with server vacations, when retrial times, service times and vacation times are arbitrary distributed. The distribution of the number of customers in the system in stationary regime is obtained in terms of generating function. Next, we give heavy traffic approximation of such distribution. We show that the system size can be decomposed into two random variables, one of which corresponds to the system size of the ordinary M/G/1 FIFO queue without vacation. Such a stochastic decomposition property is useful for the computation of performance measures of interest. Finally, we solve simple problems of optimal control of vacation and retrial policies.     

Waiting Time of M/M/c/N Queuing System with Balking,Reneging, and Multiple Synchronous Vacations of Partial Servers

The policy of synchronous vacations of partial servers is considered in an multi-server queuing system with balking and reneging. Some fixed partial idle servers take synchronous multiple vacations when these servers become idle at an instant that a customer leaves the system. In this article, by considering the two cases that the partial servers are on vacation and not on vacation, the distributions of the conditional waiting time for customers who join the system when all the available servers are busy and eventually acquire service are obtained. Based on these, the distribution of the conditional waiting time of customers given that they join the system when all available servers are busy and eventually acquire service is derived.     

Some Reliability Problems Arising in the M~x/G(M/G)/1 Repairable Queueing System with Single Delay Vacation

1　 IntroductionIn Ref.[1 ] some queueing indices of the Mx/ G( M/ G) / 1 repairable queueing system withsingle delay vacation were discussed,and the transient solution,stationary solution andstochastic decomposition of the queue length were obtained.Butwhile the service stationis up and operating,it is subject to breakdowns.Once the service station breaks down,there is a repair operation that bring the broken service station back to a new state andoperation immediately.So it is important to…     

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

考虑在服务员假期中到达的顾客以概率p(0＜p≤1)进入系统的多重休假M/G/1可修排队系统,运用全概率分解技术和拉普拉斯变换,研究了服务台的下列可靠性指标:1)首次失效前的寿命分布;2)瞬时不可用度和稳态不可用度;3)在(0,t]时间内的平均失效次数.获得了服务台一系列的可靠性结果.     

延迟启动-关闭型的N-策略M/G/1排队系统队长分布

研究服务台具有延迟启动和延迟关闭的N-策略M/G/1排队系统,利用全概率分解技术,导出了任意时刻t瞬态队长分布的Laplace变换的递推关系式,进一步得到稳态队长分布的递推式以及平稳队长分布的随机分解.最后进行了数值实验,并考察了稳态队长分布以及附加队长分布的统计性质.     

第二类故障期间以概率p进入的M/G/1可修排队

假设服务台在忙期和闲期内都可能发生故障,且具有不同的故障率,并且在闲期的故障状态期间到达顾客以概率p进入系统.使用全概率分解技术和利用拉普拉斯变换工具,研究了服务台的瞬态不可用度、稳态不可用度、(0,t]时间内的平均故障次数和稳态故障频度,获得服务台一些重要的可靠性结果,并且分别讨论了当p取值为0和取值为1时的特殊情况.     

具有强占优先权的不耐烦顾客的M/M/m/k排队模型

首先研究只有一类不耐烦顾客的M/M/m排队模型,其中顾客到达服从相互独立的泊松分布,服务时间服从相互独立的指数分布,到达率与服务率随着系统中的顾客数而发生变化。顾客的耐心等待时间(截止到服务开始前)服从指数分布。在此基础上进一步研究两类顾客到达的M/M/m/k排队系统。其中第一类顾客对于第二类顾客有强占优先权,两类顾客的到达率与服务率随着系统中顾客人数而发生变化。采用矩阵分析的方法得到了两类顾客各自的稳态分布,并有相应的性能分析,为系统的优化设计提供了依据。     

The Queue Length Distribution for M/G/1 Queue with Delay Single Server Vacation

1　IntroductionDuringrecentseveraldecadesmanyauthorsstudiedM/G/1queueswithdifferentservervacationregimes(seeRefs.[1～6]).Theynotonlystudiedthestochasticdecompositionpropertiesofthequeuelengthandwaitingtimewhenthesystemisinequilibrium,butalsostudiedthetransientandequilibriumdistributionsofthequeuelength.InRef.[6]theau-thorsstudiedM/G/1queuewithdelaymultipleservervacationsinwhichtheserverhasthreestates:vacation-preparation,vacationandbusyperiod.InthispaperwefirstdiscusstheM/G/1queuewithdelay…     

CAD系统中几何变动的建模与仿真研究

研究了三维CAD系统中几何变动的零件层建模和装配层仿真。首先，提出了变动几何约束概念和分类，研究了几何变动的定性和定量表示和建模；然后，研究了基于变动几何约束网络及其运动学模型的几何变动仿真方法，包括完全约束仿真方法和可装配性仿真方法；最后，给出了几何变动建模和仿真的总体框架和系统实现，并通过实例分析验证了方法的有效性。     

重试,反馈M/M/s/k排队的呼叫中心性能分析

由于CTI(计算机电话集成)技术的发展,使呼叫中心得到广泛的应用.与呼叫中心实现技术的发展相比,对呼叫中心管理的研究显得有些滞后,而针对呼叫中心排队模型的研究,更是如此.针对呼叫中心服务系统中的重试和反馈问题,考虑一种带重试和反馈的M/M/s/k排队模型.将等待位置和服务台数推广到有限个.在模型求解过程中,尝试采用矩阵迭代的新方法,使求解过程简单明了.然后,采用逼近的方法给出模型的数值解,并得出反馈对系统的影响随系统负荷的增大而快速增大等结论.     

具有两个服务阶段的负顾客Mξ/(G1,G2)/1休假排队系统

研究一类批到达排队系统,单服务台提供两个不同阶段的服务,并且考虑空竭服务单重休假和有负顾客到达的情形.正顾客接受第一个阶段服务后立即接受第二个阶段服务,在正顾客接受两个阶段服务的过程中均可能有负顾客到达,负顾客不接受服务,只抵消正在接受服务的正顾客.运用补充变量法列出稳态下系统的状态偏微积分方程组,从而求得了系统主要排队指标及稳态队长的概率母函数的随机分解结果.     

受控M/G/1排队系统的性能优化及迭代算法

通过嵌入Markov链的方法,讨论了受控M/G/1排队系统,在无限水平平均代价准则下的最优平稳策略问题。定义了平均Poisson方程,导出了平均代价模型在紧致行动集上的最优性方程。最后给出了一个求解最优平稳策略的迭代算法,并给出了一个仿真实例来说明该算法的应用。