带有优先权、不耐烦顾客及负顾客的$M_1,M_2/G_1,G_2/1$可修重试排队系统

研究了带有优先权,不耐烦顾客及负顾客的M1,M2/G1,G2/1可修重试排队系统.假设两类顾客的优先级不同且各自的到达过程分别服从独立的泊松过程.有优先权的顾客到达系统时如服务器忙,则以概率H1排队等候服务,以概率1-H1离开系统;而没有优先权的顾客只能一定的概率进入Orbit中进行重试,直到重试成功.此外,假设有服从Poisson过程的负顾客到达:当负顾客到达系统时,若发现服务台忙,将带走正在接受服务的顾客并使机器处于修理状态;若服务台空闲或已经处于失效状态,则负顾客立即消失,对系统没有任何影响.应用补充变量及母函数法给出了该模型的系统指标稳态解的拉氏变换表达式,并得到了此模型主要的排队指标及可靠性指标.     

具有两类平行顾客的M/M/1重试排队系统均衡策略研究

本文研究具有两类平行顾客且服务台可靠的M/M/1重试排队系统的均衡策略.在该排队系统中,两类顾客平行到达,并服从不同参数的负指数分布.当顾客进入系统时,若观察到服务台为空,将立刻开始服务;若观察到服务台处于忙期,则进入重试空间等待重试.在完全可见和几乎可见两种情形下,基于“收益-成本”理论提出合理的效用函数并对两类平行顾客进行均衡分析.此外,建立单位时间的社会收益函数,给出最优社会效益分析.最后运用数值分析直观地表示出随着系统参数的改变,顾客行为策略的变化情况.     

具有不同到达率和负顾客的工作休假Geo/Geo/1重试排队

考虑一个具有不同到达率和负顾客的工作休假Geo/Geo/1重试排队,其中正顾客在正常忙期中和工作休假期中的到达率是不同的.假设重试轨道的顾客以一定的重试率进行重试服务,负顾客到达抵消正在接受服务的正顾客.利用拟生灭过程和母函数方法得到了服务台的状态与重试轨道队长的联合分布的概率母函数,从而求得系统在稳态条件下的队长分布等一系列排队指标,进一步讨论了一些特殊情形.最后通过数值实例讨论系统参数对系统主要性能指标的影响,并说明了稳态队长分布在系统容量的优化设计中的重要价值.     

PH/M/c可修排队系统

研究了一个修理工和c个服务台的可修排队系统.假设顾客的到达过程为PH更新过程,服务台在忙时与闲时具有不同的故障率.顾客的服务时间、服务台的寿命以及服务台的修理时间均服从指数分布.通过建立系统的拟生灭过程,得到了系统稳态分布存在的充要条件.利用矩阵几何解方法,给出了系统的稳态队长.在此基础上,得到了系统的某些排队论和可靠性指标.     

带有破坏性负顾客的Geo/Geo/1/MWV可修排队系统均衡策略研究

本文研究带有破坏性负顾客的离散时间Geo/Geo/1/MWV可修排队系统的顾客策略行为.当破坏性负顾客到达系统时,会移除正在接受服务的正顾客,同时造成服务台故障.服务台一旦发生损坏,会立刻接受维修,修理时间服从几何分布.服务台在工作休假期间会以较低的服务速率对顾客进行服务.我们求得系统的稳态分布,进一步给出服务台不同状态下的均衡进入率以及系统单位时间的社会收益表达式.最后对均衡进入率和均衡社会收益进行了数值分析.     

带负顾客的Geom/Geom/1单重休假排队(英文)

本文研究了正负顾客到达均服从几何分布,服务台在工作休假期以较低的服务速率运行的 Geom/Geom/1休假排队.运用嵌入马尔科夫链和矩阵分析法,得到了系统中等待队长和稳态队长的概率母函数,并从证明过程和结果中,分别得到了服务台在闲期、忙期、工作休假期、正规忙期的概率.     

带负顾客,反馈,服务台可修的M/G/1重试排队系统

对负顾客的研究可以从不同的角度,不同的方法,不同的机制来进行.本文提出了带负顾客,反馈,服务台可修的M/G/1重试排队系统.其中负顾客的机制是带走正在接受服务的正顾客和使得服务器处于修理状态.在假定重试区域中只有队首的顾客允许重试的情况下,重试时间具有一般分布时,得到了系统稳态的充分必要条件.求得了系统稳态时队长和重试区域中队长分布及一些排队指标和可靠性指标.     

有Bernoulli休假和可选服务的Geo/G/1重试排队

讨论了有Bernoulli休假策略和可选服务的离散时间Geo/G/1重试排队系统.假定一旦顾客发现服务台忙或在休假就进入重试区域,重试时间服从几何分布.顾客在进行第一阶段服务结束后可以离开系统或进一步要求可选服务.服务台在每次服务完毕后,可以进行休假,或者等待服务下一个顾客.还研究了在此模型下的马尔可夫链,并计算了在稳态条件下的系统的各种性能指标以及给出一些特例和系统的随机分解.     

带负顾客和强占优先权的不耐烦信元排队

考虑带有负顾客的两类信元的强占优先权M/M/1排队系统.两类信元及负顾客的到达过程均为泊松过程.两类信元到达后分别在各自有限的缓冲器内排队,第一类信元较第二类信元有强占优先权,同时第一类信元是不耐烦的.负顾客一对一抵消队尾的第一类信元(若有),若系统中无第一类信元,到达的负顾客就自动消失.负顾客不接受服务.采用矩阵分析的方法得到了两类信元各自的稳态分布,并作了相应的性能分析.     

具有非强占型优先权顾客的M_1~(X_1),M_2~(X_2)/G_1,G_2/1排队系统的适定性

运用Hille-Yosida定理,Phillips定理与Fattorini定理证明具有非强占型优先权顾客的M_1~(X_1),M_2~(X_2)/G_1,G_2/1排队系统存在唯一的、非负的、满足概率性质的时间依赖解.     

Optimal allocation of priority in a M/M/1 queue with two types of customers

We consider a M/M/1 queue with two types of customers.The server suffers some loss when a non-priority customer joins the queue if the size of the queue is greater than some predetermined level N. The problem is to decide which group receives priority in such a way as to minimize the expected cost per unit of time.We show first how to determine the optimal decision. Then we introduce approximations that enable us to show that the optimal decision has a simple behaviour as a function of N, the arrival and service parameters.     

Mixed gated/exhaustive service in a polling model with priorities

In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that they are always served before any low priority customers. But high priority customers have a second advantage over low priority customers. Low priority customers are served according to the gated service discipline, i.e. only customers standing in front of the gate are served during this visit. In contrast, high priority customers arriving during the visit period of the queue are allowed to pass the gate and all low priority customers before the gate. We study the cycle time distribution, the waiting time distributions for each customer type, the joint queue length distribution of all priority classes at all queues at polling epochs, and the steady-state marginal queue length distributions for each customer type. Through numerical examples we illustrate that the mixed gated/exhaustive service discipline can significantly decrease waiting times of high priority jobs. In many cases there is a minimal negative impact on the waiting times of low priority customers but, remarkably, it turns out that in polling systems with larger switch-over times there can be even a positive impact on the waiting times of low priority customers.     

M/M/1 Queue with Impatient Customers of Higher Priority

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.     

Analysis of the M1,M2/G/1 G-queueing system with retrial customers

We consider a single server retrial queue with waiting places in service area and three classes of customers subject to the server breakdowns and repairs. When the server is unavailable, the arriving class-1 customer is queued in the priority queue with infinite capacity whereas class-2 customer enters the retrial group. The class-3 customers which are also called negative customers do not receive service. If the server is found serving a customer, the arriving class-3 customer breaks the server down and simultaneously deletes the customer under service. The failed server is sent to repair immediately and after repair it is assumed as good as new. We study the ergodicity of the embedded Markov chains and their stationary distributions. We obtain the steady-state solutions for both queueing measures and reliability quantities. Moreover, we investigate the stochastic decomposition law, the busy period of the system and the virtual waiting times. Finally, an application to cellular mobile networks is provided and the effects of various parameters on the system performance are analyzed numerically.     

The transient blended queue

This study aims to determine the transient behavior of the blended queue. Priority customers arrive over time and benefit from a threshold reservation policy, while non-priority ones can be contacted at any time. We show how to compute the Laplace transforms of the transient probabilities. Using the uniformization technique, we prove some monotonicty properties of the expected number of customers in the queue, explaining why the optimal transient reservation threshold should be lower than the stationary one.     

非强占优先权下的M/M/1排队

分析带有两个优先权的非强占M/M/1系统的性能,用补充变量法构造向量马尔可夫过程对此排队系统的状态转移方程进行分析,得到两类顾客在非强占优先权的队长联合分布的母函数,进一步讨论,得出了服务台被两类顾客占有和闲置的概率以及两类信元各自的平均队长.     

How pre-emptive priority affects completion rate in an M/M/1 queue with Poisson reneging

Queuing problems in which customers leave the queue without obtaining service (i.e. renege) have many applications. This paper looks at a queue where arrival, service and reneging events are all generated by independent Poisson processes, and customers are selected for service according to priority. A closed-form expression is derived for the probability of completing service for each priority class if high-priority customers always pre-empt low-priority ones. This result has applications in modeling the value of communications between members of an interacting population, such as a formal organization or an online community.     

An M/G/1 retrial G-queue with preemptive resume priority and collisions subject to the server breakdowns and delayed repairs

We consider an M/G/1 retrial G-queue with preemptive resume priority and collisions under linear retrial policy subject to the server breakdowns and delayed repairs. A breakdown at the busy server is represented by the arrival of a negative customer which causes the customer being in service to be lost. The stability condition of the system is derived. Using generating function technique, the steady-state distributions of the server state and the number of customers in the orbit are obtained along with some interesting and important performance measures. The stochastic decomposition property is investigated. Further, some special cases of interest are discussed. Finally, numerical illustrations are provided.