具有N-策略休假的M/G/1排队的随机分解与最优策略

本文利用向量Markov过程方法,研究了具有N-策略休假且休假时间为一般分布的M/G/1排队,它的两种特殊情况分别是具有多重休假的M/G/1排队和具有N-策略控制的M/G/1排队。我们得到了这个排队系统稳态时的队长分布,证明了它的稳态队长存在随机分解。然后讨论了当休假时间服从指数分布时的最优策略问题。     

服务员单重休假的N-策略M/G/1排队系统

研究了同时考虑单重休假和N-策略两种休假策略的排队系统,其休假准则为任一个条件满足.我们给出了此排队系统的稳态队长,忙期分布等基本指标,并得到稳态等待时间的LST(Laplace-Stieltjes Trans-form)。     

服务台休假的GI/Geom/1离散时间排队

本文研究了具有位相型休假、位相型启动和单重几何休假的离散时间排队,假定 顾客到达间隔服从一般分布,服务时间服从几何分布,运用矩阵解析方法我们得到了这 些排队系统中顾客在到达时刻稳态队长分布及其随机分解.     

两类具有N-策略和多重休假的M/G/1排队系统的最优控制策略

考虑两类具有N-策略和服务员多重休假的M/G/1排队系统,其中一类是休假不可中断,另一类是休假可中断的.利用系统稳态队长的随机分解特性导出稳态队长的概率母函数,用数值计算讨论了系统空闲率与附加平均队长对系统一些参数的敏感性.进一步,在给出的费用结构模型的基础上,利用更新报酬定理,推导出了稳态下系统在单位时间内的数学期望平均费用目标函数的解析式,然后借用MATLAB软件,求出了使目标函数达到最小的最优控制策略N^*.     

N-策略单重休假M/G/1排队系统的队长分布

本文考虑N-策略单重休假M/G/1排队系统,通过引进"服务员忙期"和使用全概率分解技术,从任意初始状态出发,研究了队长的瞬态分布和稳态分布,首次导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解.特别地,通过本文可直接获得一些特殊排队系统相应的结果.     

带负顾客和N-策略的Geo~(λ_1,λ_2)/Geo/1(MWV)排队系统分析及最优控制策略N~*

分析了一个带有负顾客、N-策略控制的Geo/Geo/1多重工作休假排队系统,其中正顾客在工作休假及正规忙期以不同的到达率进入系统.利用拟生灭过程和矩阵几何解方法,给出了该模型的稳态队长分布及平均队长,以及系统分别处于假期和忙期的概率.同时,对该系统的忙期进行了分析,并讨论了稳态队长分布在系统容量的优化设计中的应用.最后,在给定的费用结构下,用数值计算例子确定了使系统长期单位时间内期望费用最小的最优控制策略N~*.     

有负顾客到达的M/G/1休假可修排队系统

采用补充变量法和母函数的方法研究了有负顾客到达的M/G/1休假可修排队系统,其中负顾客的抵消规则是带走正在接受服务的正顾客并使得服务器处于修理状态.休假策略是空竭服务多重休假.文中给出了系统存在稳态的充要条件,系统稳态队长分布的概率母函数及系统可靠度的L变换.     

带负顾客和N-策略的Geo^{lambda_1, lambda_2/Geo/1(MWV)排队系统分析及最优控制策略N*

分析了一个带有负顾客、N-策略控制的Geo/Geo/1多重工作休假排队系统, 其中正顾客在工作休假及正规忙期以不同的到达率进入系统. 利用拟生灭过程和矩阵几何解方法, 给出了该模型的稳态队长分布及平均队长, 以及系统分别处于假期和忙期的概率. 同时, 对该系统的忙期进行了分析, 并讨论了稳态队长分布在系统容量的优化设计中的应用. 最后, 在给定的费用结构下, 用数值计算例子确定了使系统长期单位时间内期望费用最小的最优控制策 N*.     

带反馈的多重休假M~X/G/1排队

研究批量到达带反馈的多重休假M/G/1排队.建立休假,反馈,和成批到达的多类型相结合的排队模型.采用了嵌入马尔可夫链的方法研究了该排队系统,推导出稳态队长分布的母函数及其随机分解结果,给出忙期的LST和全假期的均值.最后考虑了批量等于1的特殊情况.     

具有不耐烦顾客和K-重工作休假的M^X/M/1排队系统分析北大核心CSCD

研究了一个等待空间无限的具有不耐烦顾客和K-重工作休假M^X/M/1排队系统.当系统中没有顾客时服务员转入工作休假状态;服务员最多可进行K次休假,若K次之后系统中仍没有顾客,服务员进入闲期.顾客按Poisson过程批量到达,到达的批量服从一般离散分布.在工作休假期间,到达的顾客可能由于等待不耐烦而离开系统.文章建立了系统的稳态平衡方程,利用概率母函数的方法得到了稳态下正常忙期的平均队长和工作休假期的平均队长以及其他一些相关指标的解析表达式.最后,利用数值算例分析了系统参数以及参数K的变化对稳态指标的影响.     

Analysis of the queue-length distribution for the discrete-time batch-service Geo/G/1/K queue

In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we first obtain the queue-length distribution just after a service completion, using the embedded Markov chain technique. Then we establish a relationship between the queue-length distribution just after a service completion and that at a random epoch, using elementary ‘rate-in = rate-out’ arguments. Based on this relationship, we obtain the queue-length distribution at a random (as well as at an arrival) epoch, from which important performance measures of practical interest, such as the mean queue length, the mean waiting time, and the loss probability, are also obtained. Sample numerical examples are presented at the end.     

成批到达的有特殊服务时间的多重休假排队系统分析

本文利用嵌入马尔可夫链方法研究了多重休假M^X／Gn／1排队系统。首先，利用概率分析法得到了排队系统的嵌入马尔可夫链的一步转移概率矩阵，以此为依据得到系统的稳态队长和同批第一个接受服务顾客的稳态等待时间。     

TRANSIENT SOLUTION FOR QUEUE-LENGTH DISTRIBUTION OF Geometry/G/1 QUEUEING MODEL

In this paper, the Geometry/G/1 queueing model with inter-arrival times generated by a geometric（parameter p） distribution according to a late arrival system with delayed access and service times independently distributed with distribution {gj }, j≥ 1 is studied. By a simple method （techniques of probability decomposition, renewal process theory） that is different from the techniques used by Hunter（1983）, the transient property of the queue with initial state i（i ≥ 0） is discussed. The recursion expression for u -transform of transient queue-length distribution at any time point n^＋ is obtained, and the recursion expression of the limiting queue length distribution is also obtained.     

An infinite-server queue influenced by a semi-Markovian environment

We consider an infinite-server queue, where the arrival and service rates are both governed by a semi-Markov process that is independent of all other aspects of the queue. In particular, we derive a system of equations that are satisfied by various “parts” of the generating function of the steady-state queue-length, while assuming that all arrivals bring an amount of work to the system that is either Erlang or hyperexponentially distributed. These equations are then used to show how to derive all moments of the steady-state queue-length. We then conclude by showing how these results can be slightly extended, and used, along with a transient version of Little’s law, to generate rigorous approximations of the steady-state queue-length in the case that the amount of work brought by a given arrival is of an arbitrary distribution.      

N-策略M/G/1/∞排队系统的队长分布表达式

本文考虑N-策略M／G／1／∞排队系统，研究了队长的瞬态和稳态性质。通过引进“服务员忙期”和使用全概率分解技术，我们导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式，以及平稳队长的随机分解。特别地，通过本文可直接获得一些特殊排队系统相应的结果。     

基于最大熵的延迟启动/关闭N策略M/G/1可修排队稳态队长分布

研究具有延迟启动-关闭的N策略M/G/1可修排队系统,利用最大熵方法导出稳态队长分布的解析解,进一步得到基于最大熵的顾客平均等待时间.通过比较顾客的平均等待时间来检验最大熵方法的精度,结果表明基于最大熵方法得到的稳态队长分布是相当精确的.     

Queue-length balance equations in multiclass multiserver queues and their generalizations

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: The distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid is that arrivals, and also service completions, with probability one occur individually, i.e., not in batches. We show that it is easy to write down somewhat similar balance equations for multidimensional queue-length processes for a quite general network of multiclass multiserver queues. We formally derive those balance equations under a general framework. They are called distributional relationships and are obtained for any external arrival process and state-dependent routing as long as certain stationarity conditions are satisfied and external arrivals and service completions do not simultaneously occur. We demonstrate the use of these balance equations, in combination with PASTA, by (1) providing very simple derivations of some known results for polling systems and (2) obtaining new results for some queueing systems with priorities. We also extend the distributional relationships for a nonstationary framework.     

Efficient computational analysis of non-exhaustive service vacation queues: BMAP/R/1/N(∞) under gated-limited discipline

This paper analyzes the finite-buffer single server queue with vacation(s). It is assumed that the arrivals follow a batch Markovian arrival process (BMAP) and the server serves customers according to a non-exhaustive type gated-limited service discipline. It has been also considered that the service and vacation distributions possess rational Laplace-Stieltjes transformation (LST) as these types of distributions may approximate many other distributions appeared in queueing literature. Among several batch acceptance/rejection strategies, the partial batch acceptance strategy is discussed in this paper. The service limit L (1 ≤ L ≤ N) is considered to be fixed, where N is the buffer-capacity excluding the one in service. It is assumed that in each busy period the server continues to serve until either L customers out of those that were waiting at the start of the busy period are served or the queue empties, whichever occurs first. The queue-length distribution at vacation termination/service completion epochs is determined by solving a set of linear simultaneous equations. The successive substitution method is used in the steady-state equations embedded at vacation termination/service completion epochs. The distribution of the queue-length at an arbitrary epoch has been obtained using the supplementary variable technique. The queue-length distributions at pre-arrival and post-departure epoch are also obtained. The results of the corresponding infinite-buffer queueing model have been analyzed briefly and matched with the previous model. Net profit function per unit of time is derived and an optimal service limit and buffer-capacity are obtained from a maximal expected profit. Some numerical results are presented in tabular and graphical forms.     

On the average optimality of circular assignment policy

We consider a parallel queueing system with identical exponential servers. Customers arrive according to a renewal process and upon arrival are immediately assigned to those queues. The problem is to find an optimal assignment policy minimizing the longrun average expected cost, without information about the current queue lengths, but with the initial queue-length distributions and information about the past arrival process and assignment of customers. In this paper, it is shown that the so-called circular assignment policy is optimal under mild conditions on the initial queue-length distributions and the holding cost.