假期中以概率p进入的单重休假M/G/1排队系统的控制策略

考虑在-策略控制下服务员具有单重休假的M/G/1排队系统,其中在服务员休假期间到达顾客以概率p(0≤p≤1)进入系统.在建立费用结构模型的基础上,使用更新报酬定理,推导出了系统长期单位时间内的期望费用的显示表达式,然后在服务员休假时间内顾客进入概率p固定不变的情况下,通过数值实例讨论了服务员休假时间的最优控制策略T^(*).进一步,从系统服务能力的角度,讨论了在限制平均队长不超过某个固定正整数阈值L0条件下允许进入概率p的最佳取值p^(*).     

假期中顾客以概率p进入的单重休假M/G/1排队

本文考虑单重休假M/G/1排队系统,其中在服务员休假中到达的顾客以概率p(0≤p≤1)进入系统,采用一种较简单的分析方法,得到了队长瞬态分布的拉普拉斯变换的递推表达式和稳态分布的递推表达式.另外,通过本文的研究直接导出了一些特殊情况下的相应结果.     

基于p-进入规则和单重休假的Min(N,V)-策略M/G/1排队

研究具有p-进入规则和基于服务员单重休假Min(N,V)-策略控制的M/G/1排队系统,其中在服务员休假期间到达的顾客以概率p (0≤p≤1)进入系统.运用全概率分解技术和拉普拉斯变换工具,借助更新过程理论,讨论了系统从任意初始状态出发,在任意时刻t的瞬态队长分布,得到了瞬态队长分布的拉普拉斯变换表达式.进一步获得了稳态队长分布的递推表达式,并给出了p=0与p=1的特殊结果.最后,通过数值计算实例讨论了系统容量的最优设计问题.     

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

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

服务员多重假期中以概率p进入的M/G/1排队系统的进一步研究

考虑在多重假期中顾客到达以概率p(0-控制策略.首先通过数值实例分析了系统两个主要性能指标对系统参数p和T的敏感性,然后借用稳态队长分布{p_j,j-0,1,2…}讨论了系统容量的优化设计.其次,在建立费用结构模型的基础上,导出了系统在长期单位时间内的期望费用的显示表达式,并通过数值实例确定了在进入概率p固定时使系统单位时间期望费用最小的服务员休假时间的最优控制策略T*.最后,从系统的服务能力角度,在限制平均队长不超过某个固定正整数阀值L₀条件下,通过数值实例分别讨论了最佳进入概率p*和最佳休假时间T*.     

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

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

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

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

M／M／1／N多重工作休假排队系统的性能分析

本文研究M/M/1/N多重工作休假排队系统,简记为M/M/1/N(WV).利用马尔科夫过程理论和矩阵解法求出了稳态概率的矩阵解,并得到了系统的平均队长、平均等待队长以及顾客的消失概率等性能指标.最后通过数值例子我们分析了系统的参数,休假时的工作率μν和休假率θ对平均队长的影响.     

延迟控制休假的M／M／1排队系统

本文研究带有延迟休假的 Ｍ／Ｍ／１排队系统,服务员在空闲了一段时间（称做延迟时间）后才正式开始休假,每次休假的时间长度有指数分布．若一次休假结束时系统中的顾客数目低于某一水平Ｋ,则服务员开始另一次休假;否则转为投入服务,这时系统开始一个新的忙期。对于延迟时间有指数分布和是确定的情形分别求得系统的稳态分布的精确表示及某些性能指标．文章还讨论了系统优化问题,给出使得单位时间平均总成本最小的Ｋ值．证明在泊松到达的情形最优延迟时间是０（无延迟）或无穷（无休假）     

Bernoulli控制下的带有负顾客和启动时间的M/M/1休假排队

研究在Bernoulli控制下的带有负顾客和启动时间的M/M/1休假排队系统,负顾客抵消队首正在接受服务的正顾客.在正规期,若系统中没有正顾客,服务员以概率α(0≤α≤1)进入普通休假,或以概率β(β=1-α)进入工作休假.利用拟生灭过程和矩阵几何解的方法,得到了系统的稳态队长.最后,通过数值例子来说明-些参数对系统队长的影响.     

The queue-length distribution for Mx/G1 queue with single server vacation

1 IntroductionDuring recent decades many authors studied M/G/l queues with server vacations (seeRefS[1 ~ 6]). They not only studied the stocliastic decomposition properties of the queue lengthand waiting time when the system is in equilibrium, but also studied its transient and equilibrium distributions. Although Baba[7] studied bulk-arrival M"/G/1 with vacation time andShils] studied a kind of M"/G(M/H)/1 queue with repairable service station, they didll't studythe transient and equilibr…     

Batch arrival queues under vacation policies with server breakdowns and startup/closedown times

This paper studies the operating characteristics of an M^[x]/G/1 queueing system under vacation policies with startup/closedown times, where the vacation time, the startup time, and the closedown time are generally distributed. When all the customers are served in the system exhaustively, the server shuts down (deactivates) by a closedown time. After shutdown, the server operates one of (1) multiple vacation policy and (2) single vacation policy. When the server reactivates since shutdown, he needs a startup time before providing the service. If a customer arrives during a closedown time, the service is immediately started without a startup time. The server may break down according to a Poisson process while working and his repair time has a general distribution. We analyze the system characteristics for the vacation models.     

On M/G/1 system under NT policies with breakdowns,startup and closedown

This paper studies the vacation policies of an M/G/1 queueing system with server breakdowns, startup and closedown times, in which the length of the vacation period is controlled either by the number of arrivals during the vacation period, or by a timer. After all the customers are served in the queue exhaustively, the server is shutdown (deactivates) by a closedown time. At the end of the shutdown time, the server immediately takes a vacation and operates two different policies: (i) The server reactivates as soon as the number of arrivals in the queue reaches to a predetermined threshold N or the waiting time of the leading customer reaches T units; and (ii) The server reactivates as soon as the number of arrivals in the queue reaches to a predetermined threshold N or T time units have elapsed since the end of the closedown time. If the timer expires or the number of arrivals exceeds the threshold N, then the server reactivates and requires a startup time before providing the service until the system is empty. If some customers arrive during this closedown time, the service is immediately started without leaving for a vacation and without a startup time. We analyze the system characteristics for each scheme.     

On the discrete-time Geo/G/1 queue with randomized vacations and at most J vacations

This paper examines a discrete-time Geo/G/1 queue, where the server may take at most J − 1 vacations after the essential vacation. In this system, messages arrive according to Bernoulli process and receive corresponding service immediately if the server is available upon arrival. When the server is busy or on vacation, arriving messages have to wait in the queue. After the messages in the queue are served exhaustively, the server leaves for the essential vacation. At the end of essential vacation, the server activates immediately to serve if there are messages waiting in the queue. Alternatively, the server may take another vacation with probability p or go into idle state with probability (1 − p) until the next message arrives. Such pattern continues until the number of vacations taken reaches J. This queueing system has potential applications in the packet-switched networks. By applying the generating function technique, some important performance measures are derived, which may be useful for network and software system engineers. A cost model, developed to determine the optimum values of p and J at a minimum cost, is also studied.     

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

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

Operating characteristic analysis on the M/G/1 system with a variant vacation policy and balking

This paper studies the operating characteristics of an M^[x]/G/1 queueing system under a variant vacation policy, where the server leaves for a vacation as soon as the system is empty. The server takes at most J vacations repeatedly until at least one customer is found waiting in the queue when the server returns from a vacation. If the server is busy or on vacation, an arriving batch balks (refuses to join) the system with probability 1 − b. We derive the system size distribution at different points in time, as well as the waiting time distribution in the queue. Finally, important system characteristics are derived along with some numerical illustration.     

The GI/M/1 queue with phase-type working vacations and vacation interruption

Consider a GI/M/1 queue with phase-type working vacations and vacation interruption where the vacation time follows a phase-type distribution. The server takes the original work at the lower rate during the vacation period. And, the server can come back to the normal working level at a service completion instant if there are customers at this instant, and not accomplish a complete vacation. From the PH renewal process theory, we obtain the transition probability matrix. Using the matrix-analytic method, we obtain the steady-state distributions for the queue length at arrival epochs, and waiting time of an arbitrary customer. Meanwhile, we obtain the stochastic decomposition structures of the queue length and waiting time. Two numerical examples are presented lastly.     

推广的多重休假$M^X/G/1$排队系统

在平稳状态下,Baba利用补充变量方法研究了多重休假的MX/G/1排队,但作者假定了休假时间和服务时间都有概率密度函数.本文考虑推广的多重休假MX/G/1排队,在假定休假时间和服务时间都是一般概率分布函数下,我们研究了队长的瞬态和稳态性质.通过引进"服务员忙期"和使用不同于Baba文中使用的分析技术,我们导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解.特别地,通过本文可直接获得多重休假的M/G/1与标准的MX/G/1排队系统相应的结果.     

BMAP/G/1/N queue with vacations and limited service discipline

We consider a finite buffer single server queue with batch Markovian arrival process (BMAP), where server serves a limited number of customer before going for vacation(s). Single as well as multiple vacation policies are analyzed along with two possible rejection strategies: partial batch rejection and total batch rejection. We obtain queue length distributions at various epochs and some important performance measures. The Laplace–Stieltjes transforms of the actual waiting time of the first customer and an arbitrary customer in an accepted batch have also been obtained.