共查询到16条相似文献,搜索用时 125 毫秒
1.
M/M/1算子的特征值及其应用(英文) 总被引:1,自引:1,他引:0
讨论 M/M/1算子的谱特征,证明0是 M/M/1算子的几何重数为 1的特征值,并且对应的特征向量是正的,作为应用给出了排队论中四个指标:系统中顾客的平均逗留时间,顾客的平均等待时间,顾客总数及等待的顾客总数的计算方法. 相似文献
2.
在到达系统的顾客数不变的情况下,顾客到达系统但是否进入系统接受服务对销售行业影响是巨大的.从排队长度对顾客输入率的影响着手,研究了顾客以泊松流到达系统,而到达系统的顾客进入系统接受服务的概率与队长有关的M/M/1排队模型,且系统服务会出差错.得出了进入系统的顾客流是泊松过程,且系统中的顾客数是生灭过程,并获得了该模型的平稳分布、顾客的平均输入率、系统的平均服务强度等多项指标,为销售行业调整自己的服务速度以影响排队长度及顾客输入率,进而提高自己的销售业绩提供了很有价值的参考. 相似文献
3.
4.
5.
6.
7.
通过M/G/1算子的谱分析得到了M/G/1排队论系统的渐近稳定性.首先,将系统方程转化为某一合适Banach空间上的抽象Cauchy闻题,从而引入M/G/1算子.其次,分析了M/G/1算子的谱分布,得到了0是M/G/1算子的简单本征值且M/G/1算子的谱分布在左半平面的结果.最后,利用谱分析结果和算子半群理论得到了M/... 相似文献
8.
9.
研究偏微分方程形式的M/M/1排队模型的主算子在左半复平面中的谱,证明当顾客的到达率λ,服务员的服务率μ和非零实数b满足一定的条件时,-μ+ib不是该主算子的特征值,其中i~2=-1. 相似文献
10.
研究偏微分方程形式的M/M/1排队模型的主算子在左半复平面中的谱,证明当顾客的到达率λ和服务员的服务率μ满足λ<μ,λ~2+μ~2≠3λμ时,μ不是A+U+E的特征值. 相似文献
11.
We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach. 相似文献
12.
We introduce a simple approach for the analysis of the M/M/c queues with a single class of customers and constant impatience time by finding simple Markov processes (see (2.1) and (2.15) below), and then by applying this approach we analyze the M/M/1 queues with two classes of customers in which class 1 customers have impatience of constant duration, and class 2 customers have no impatience and lower priority than class 1 customers. 相似文献
13.
In this paper, we study the transient behavior of a state dependent M/M/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. For two special cases called the threshold policy and the static policy we determine simple expressions for their joint transform. 相似文献
14.
本文讨论具有随机N-策略的M/G/1排队系统,采用向量Markov过程方法得到该系统有关的排队指标。上述结果可以看作是普通的和N-策略的M/G/1排队系统的推广。 相似文献
15.
B. D’Auria 《Queueing Systems》2008,58(3):221-237
In this paper we investigate an M/M/∞ queue whose parameters depend on an external random environment that we assume to be
a semi-Markovian process with finite state space. For this model we show a recursive formula that allows to compute all the
factorial moments for the number of customers in the system in steady state. The used technique is based on the calculation
of the raw moments of the measure of a bidimensional random set. Finally the case when the random environment has only two
states is deeper analyzed. We obtain an explicit formula to compute the above mentioned factorial moments when at least one
of the two states has sojourn time exponentially distributed.
Part of this research took place while the author was still post-doc at EURANDOM, Eindhoven, The Netherlands. The work was
supported by the Spanish Ministry of Education and Science by the Grant MTM2007-63140. 相似文献
16.
Arzad A. Kherani 《Queueing Systems》2006,53(3):159-169
In this paper we present a direct approach to obtaining joint distributions of various quantities of interest in a busy period
in an M/M/1 queue. These quantities are: the sojourn times and waiting times of all the customers in the busy period, the busy period length and the number of customers served in a busy period. Since the evolution
of the total workload process between two successive customer arrivals is deterministic, this work gives statistic of the
complete evolution of the workload process within a busy period.
This work was done when the author was post doctoral fellow with the MAESTRO group at INRIA, Sophia Antipolis, France, and
was supported by project no. 2900-IT-1 from the Centre Franco-Indien pour la Promotion de la Recherche Avancee (CEFIPRA). 相似文献