共查询到20条相似文献,搜索用时 0 毫秒
2.
Consider an M/G/1 queue such that over and above the first essential service having a general service time distribution, a unit may need a second optional service with another independent general service time. A unit may depart from the system either after the first essential service with probability (1–r) or at the end of the first service may immediately go for a second service with probability r (0r1). This is a generalization of a recent paper considered by Madan [5]. 相似文献
3.
4.
假期中顾客以概率p进入的单重休假M/G/1排队 总被引:4,自引:1,他引:4
本文考虑单重休假M/G/1排队系统,其中在服务员休假中到达的顾客以概率p(0≤p≤1)进入系统,采用一种较简单的分析方法,得到了队长瞬态分布的拉普拉斯变换的递推表达式和稳态分布的递推表达式.另外,通过本文的研究直接导出了一些特殊情况下的相应结果. 相似文献
5.
We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals and regularly varying service time distribution with index ?ν, it is shown that the waiting time distribution is also regularly varying, with index 1?ν, and the pre-factor is determined explicitly. Another contribution of the paper is the heavy-traffic analysis of the waiting time distribution in the M/G/1 case. We consider not only the case of finite service time variance, but also the case of regularly varying service time distribution with infinite variance. 相似文献
6.
考虑具延误休假时间的N-策略M/G/1/∞排队系统,研究队长的瞬态和稳态性质.通过引进“服务员忙期”和使用全概率分解技术,导出在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解. 相似文献
7.
This paper considers a stable GI∨GI∨1 queue with a regularly varying service time distribution. We derive the tail behaviour of the integral of the queue length process Q(t) over one busy period. We show that the occurrence of a large integral is related to the occurrence of a large maximum of the queueing process over the busy period and we exploit asymptotic results for this variable. We also prove a central limit theorem for ∫0t Q(s) ds.AMS subject classification: 60K25, 90B22. 相似文献
8.
本文考虑了单重休假排队系统,其中在服务员休假中到达的顾客以概率p(0≤p≤1)进入系统,通过采用马尔科夫骨架方法(MSP),得到了队长的瞬时分布. 相似文献
9.
10.
Fikri Karaesmen Surendra M. Gupta 《The Journal of the Operational Research Society》1996,47(6):817-828
We consider the GI/M/1/K queue where the server takes exponentially distributed vacations when there are no customers left to serve in the queue. We obtain the queue length distribution at arrival epochs and random epochs for the multiple vacation case. We present heuristic algorithms to compute the blocking probability for this system. Several numerical examples are presented to analyze the behaviour of the blocking probability and to test the performance of the heuristics. 相似文献
11.
A queueing model with server vacations is studied in which it is assumed that the interarrival time has a general distribution, the service-time distribution is exponential and vacations are independently and indentically distributed with a general distribution. Using the embedded Markov chain technique, the equilibrium probability distributions of system size have been obtained at pre-arrival and at random epochs separately. Finally, the distribution of waiting time of a customer in the queue (excluding service) has been derived. 相似文献
12.
本文考虑了具有破坏性和非破坏性服务中断的离散重试排队系统.两类中断都发生在顾客接受服务的过程中,假设服务台在工作时发生破坏性中断,则正在接受服务的顾客中断服务,进入到重试空间中去,重新尝试以接受服务;若服务台在工作时发生非破坏性中断,则正在接受服务的顾客将等待中断结束后再继续完成剩余的服务量.求出了系统存在稳态的充分必要条件.利用补充变量法,求出了系统稳态时系统和重试区域中队长分布的概率母函数,以及其他一些重要的排队指标,并且给出了对应的连续时间下具有两类服务中断的M/G/1排队的队长分布的概率母函数.最后,通过数值算例研究了各种参数对平均队长的影响. 相似文献
13.
D. Fakinos 《The Journal of the Operational Research Society》1984,35(5):439-445
This paper considers the infinite server queue with arrivals generated by a non-homogeneous compound Poisson process. In such a system, customers arrive in groups of variable size, the arrival epochs of groups being points of a non-homogeneous Poisson process, and they are served without delay. The service times of customers who belong to the same group need not be independent nor identically distributed. Assuming that the system is initially empty, the transient distribution of the queue size and of the counting departure process is obtained. Also the limiting queue size distribution (when it exists) is determined and it is found to be insensitive to the form the service time distribution functions. 相似文献
14.
本文考虑了具有可利用服务员的M/G/1有有限容量的排队模型.当工作量超过k(k是常数或者随机变量),可利用服务员参与工作,一直到工作量少于或等于k.可利用服务员的速率依赖于目前工作量.应用Level-crossing方法,获得了工作量的平稳分布.应用Kolmogorov向后微分方程方法,构造更新方程以获得忙期的Laplace变换. 相似文献
15.
Attahiru Sule Alfa 《The Journal of the Operational Research Society》1979,30(7):665-667
Using the method of discrete time analysis, a numerical method is developed for evaluating the distribution of the delay encountered by a customer in a time-inhomogeneous, single server queue with batch arrivals. 相似文献
16.
Retrial queues have been widely used to model many problems arising in telephone switching systems, telecommunication networks, computer networks and computer systems, etc. It is of basic importance to study reliability of retrial queues with server breakdowns and repairs because of limited ability of repairs and heavy influence of the breakdowns on the performance measure of the system. However, so far the repairable retrial queues are analyzed only by queueing theory. In this paper we give a detailed analysis for reliability of retrial queues. By using the supplementary variables method, we obtain the explicit expressions of some main reliability indexes such as the availability, failure frequency and reliability function of the server. In addition, some special queues, for instance, the repairable M/G/1 queue and repairable retrial queue can be derived from our results. These results may be generalized to the repairable multi-server retrial models. 相似文献
17.
18.
19.
20.
《随机分析与应用》2013,31(5):1151-1173
Abstract In this paper, we consider a finite-buffer bulk-arrival and bulk-service queue with variable server capacity: M X /G Y /1/K + B. The main purpose of this paper is to discuss the analytic and computational aspects of this system. We first derive steady-state departure-epoch probabilities based on the embedded Markov chain method. Next, we demonstrate two numerically stable relationships for the steady-state probabilities of the queue lengths at three different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as moments of the number of customers in the queue at three different epochs, the loss probability, and the probability that server is busy. Numerical results are presented for a deterministic service-time distribution – a case that has gained importance in recent years. 相似文献