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

本文研究带反馈的具有正、负两类顾客的M／M／1工作休假排队模型。工作休假策略为空竭服务多重工作休假。负顾客一对一抵消队首正在接受服务的正顾客（若有），若系统中无正顾客时，到达的负顾客自动消失，负顾客不接受服务。完成服务的正顾客以概率p（0〈p≤1）离开系统，以概率1-P反馈到队尾寻求再次服务。使用拟生灭过程和矩阵几何解方法得到了系统队长的稳态分布，证明了系统队长随机分解结果并给出稳态下系统中正顾客的平均队长。     

带RCE抵消策略的负顾客M/M/1工作休假排队系统

考虑服务员在休假期间不是完全停止工作,而是以相对于正常工作时低些的速率服务顾客的M/M/1工作休假排队模型.在此模型基础上,笔者针对现实的M/M/1排队模型中可能出现的外来干扰因素,提出了带RCE(Removal of Customers at the End)抵消策略的负顾客M/M/1工作休假排队这一新的模型.服务规则为先到先服务.工作休假策略为空竭服务多重工作休假.抵消原则为负顾客一对一抵消队尾的正顾客,若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.使用拟生灭过程和矩阵几何解方法给出了系统队长的稳态分布,证明了系统队长和等待时间的随机分解结果并给出稳态下系统中正顾客的平均队长和顾客在系统中的平均等待时间.     

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

本文研究带反馈的具有正、负两类顾客的M/M/1工作休假排队模型.工作休假策略为空竭服务多重工作休假.负顾客一对一抵消队尾的正顾客(若有),若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.完成服务的正顾客以概率p(0相似文献   

带有负顾客的M/M/c多重工作休假排队

考虑服务台在休假期间不是完全停止工作,而是以相对于正常服务期低些的服务率服务顾客的M/M/c工作休假排队模型.在此模型基础上,针对现实的M/M/c排队模型中可能出现的外来干扰因素,提出了带有负顾客的M/M/c工作休假排队这一新的模型.服务规则为先到先服务.工作休假策略为空竭服务异步多重工作休假.抵消原则为负顾客一对一抵消处于正常服务期的正顾客,若系统中无处于正常服务期的正顾客时,到达的负顾客自动消失,负顾客不接受服务.首先,由该多重休假模型得到其拟生灭过程及生成元矩阵,然后运用矩阵几何方法给出系统队长的稳态分布表达式和若干系统指标.     

带有负顾客且具有反馈的M/M/1/N工作休假排队

研究带反馈的且具有正、负两类顾客的M/M/1/N工作休假排队模型.工作休假策略为空竭服务多重工作休假.负顾客一对一抵消队首正在接受服务的正顾客(若有),若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.完成服务的正顾客以概率p(0相似文献   

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

本文考虑一个具有负顾客到达的M／G／1可修捧队系统．所有顾客(包括正顾客和负顾客)的到达都是泊松过程,服务器是可修的．Harrison和Pitel研究过具有负顾客到达的M／G／1捧队系统．这里我们推广到有可修服务器情形,系统的稳态解最后可以通过Fredholm积分方程解出．     

对一类到达率可变的多重工作休假排队平稳状态的分析北大核心CSCD

讨论到达率依赖于当前系统中顾客数的M(n)/M/1多重工作休假排队.首先对排队模型用无限位相GI/M/1型Markov过程建模.其次通过用矩阵解析方法对所得过程求解,得到了排队系统平稳状态相关指标的结果.     

对一类到达率可变的多重工作休假排队平稳状态的分析

讨论到达率依赖于当前系统中顾客数的M(n)/M/1多重工作休假排队.首先对排队模型用无限位相GI/M/1型Markov过程建模.其次通过用矩阵解析方法对所得过程求解,得到了排队系统平稳状态相关指标的结果.     

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

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

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

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

Analysis of a finite MAP/G/1 queue with group services

The finite capacity queues, GI/PH/1/N and PH/G/1/N, in which customers are served in groups of varying sizes were recently introduced and studied in detail by the author. In this paper we consider a finite capacity queue in which arrivals are governed by a particular Markov renewal process, called a Markovian arrival process (MAP). With general service times and with the same type of service rule, we study this finite capacity queueing model in detail by obtaining explicit expressions for (a) the steady-state queue length densities at arrivals, at departures and at arbitrary time points, (b) the probability distributions of the busy period and the idle period of the server and (c) the Laplace-Stieltjes transform of the stationary waiting time distribution of an admitted customer at points of arrivals. Efficient algorithmic procedures for computing the steady-state queue length densities and other system performance measures when services are of phase type are discussed. An illustrative numerical example is presented.     

Performance analysis of discrete-time queue GI/G/1 with negative arrivals

In this paper, we consider a discrete-time GI/G/1 queueing model with negative arrivals. By deriving the probability generating function of actual service time of ordinary customers, we reduced the analysis to an equivalent discrete-time GI/G/1 queueing model without negative arrival, and obtained the probability generating function of buffer contents and random customer delay.     

Strong stability of the embedded Markov chain in an GI/M/1 queue with negative customers

This paper is devoted to the investigation for sufficient conditions of the strong stability of the embedded Markov chain in GI/M/1 queueing system with negative customers. After perturbing the occurrence rate of the negative customers, we prove the strong stability of the considered Markov chain with respect to a convenient weight variation norm. Furthermore, we estimate the deviation of its transition operators and provide an upper bound to the approximation error. This results allow us to understand how the negative customers will affect the system’s level of performance.     

The MM CPP/GE/c G-Queue: Sojourn Time Distribution

We obtain the sojourn time probability distribution function at equilibrium for a Markov modulated, multi-server, single queue with generalised exponential (GE) service time distribution and compound Poisson arrivals of both positive and negative customers. Such arrival processes can model both burstiness and correlated traffic and are well suited to models of ATM and other telecommunication networks. Negative customers remove (ordinary) customers in the queue and are similarly correlated and bursty. We consider both the cases where negative customers remove positive customers from the front and the end of the queue and, in the latter case, where a customer currently being served can and cannot be killed by a negative customer. These cases can model an unreliable server or load balancing respectively. The results are obtained as Laplace transforms and can be inverted numerically. The MM CPP/GE/c G-Queue therefore holds the promise of being a viable building block for the analysis of queues and queueing networks with bursty, correlated traffic, incorporating load balancing and node-failures, since the equilibrium behaviour of both queue lengths and response times can be determined in a tractable way.     

An M/G/1 queue with cyclic service times

In this paper we consider a single server queue with Poisson arrivals and general service distributions in which the service distributions are changed cyclically according to customer sequence number. This model extends a previous study that used cyclic exponential service times to the treatment of general service distributions. First, the stationary probability generating function and the average number of customers in the system are found. Then, a single vacation queueing system with aN-limited service policy, in which the server goes on vacation after servingN consecutive customers is analyzed as a particular case of our model. Also, to increase the flexibility of using theM/G/1 model with cyclic service times in optimization problems, an approximation approach is introduced in order to obtain the average number of customers in the system. Finally, using this approximation, the optimalN-limited service policy for a single vacation queueing system is obtained.On leave from the Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran 16844, Iran.