排序方式: 共有19条查询结果,搜索用时 156 毫秒
1.
We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies. 相似文献
2.
We study a multi-server M/M/c type queue with a single vacation policy for some idle servers. In this queueing system, if at a service completion instant, any d (d c) servers become idle, these d servers will take one and only one vacation together. During the vacation of d servers, the other c–d servers do not take vacation even if they are idle. Using a quasi-birth-and-death process and the matrix analytic method, we obtain the stationary distribution of the system. Conditional stochastic decomposition properties have been established for the waiting time and the queue length given that all servers are busy. 相似文献
3.
Abstract In this article, we study a queueing system M x /G/1 with multiple vacations. The probability generating function (P.G.F.) of stationary queue length and its expectation expression are deduced by using an embedded Markov chain of the queueing process. The P.G.F. of stationary system busy period and the probability of system in service state and vacation state also are obtained by the same method. At last we deduce the LST and mean of stationary waiting time in the service order FCFS and LCFS, respectively. 相似文献
4.
This paper considers several single-server two-class queueing systems with different cost functions. Customers in the two classes are discriminated by service rates and relative priorities. Most attention is focused on the ones with general quadratic bivariable and exponential cost functions that are usually applied in the relatively complicated systems. To the best of the authors’ knowledge, there is no literature analyzing these two kinds of cost functions on the subject of relative priority. We explicitly present the conditions under which relative priority outperforms absolute priority for reducing system cost and further provide the method to find the optimal DPS policy. Moreover, we also discuss variations where service rates of the two classes are decision variables under service equalization and service discrimination disciplines, respectively. 相似文献
5.
Wei Sun Pengfei Guo Naishuo Tian 《Central European Journal of Operations Research》2010,18(3):241-268
This paper considers two types of setup/closedown policies: interruptible and insusceptible setup/closedown policies. When
all customers are served exhaustively in a system under the interruptible setup/closedown policy, the server shuts down (deactivates)
by a closedown time. When the server reactivates since shutdown, he needs a setup time before providing service again. If
a customer arrives during a closedown time, the service is immediately started without a setup time. However, in a system
under the insusceptible setup/closedown policy, customers arriving in a closedown time can not be served until the following
setup time finishes. For the systems with interruptible setup/closedown times, we assume both the fully and almost observable
cases, then derive equilibrium threshold strategies for the customers and analyze the stationary behavior of the systems.
On the other hand, for the systems with insusceptible setup/closedown times, we only consider the fully observable case. We
also illustrate the equilibrium thresholds and the social benefits for systems via numerical experiments. As far as we know,
there is no work concerning equilibrium behavior of customers in queueing systems with setup/closedown times. 相似文献
6.
We study a discrete-time GI/Geo/1 queue with server vacations. In this queueing system, the server takes vacations when the system does not have any waiting customers at a service completion instant or a vacation completion instant. This type of discrete-time queueing model has potential applications in computer or telecommunication network systems. Using matrix-geometric method, we obtain the explicit expressions for the stationary distributions of queue length and waiting time and demonstrate the conditional stochastic decomposition property of the queue length and waiting time in this system. 相似文献
7.
8.
9.
多级适应性休假的M/G/1排队 总被引:6,自引:0,他引:6
在经典M/G/1排队中引入多级适应性休假规则,得到稳态队长、等待时间分布和随机分解,并给出忙期、假期、在线期分布.单重休假和多重休假模型是本文中模型的两个极端情况. 相似文献
10.
We introduce the control parameterN in a common queue M/G/1 with vacations; the end of a global vacation period is controlled by the parameterN. This extension for a queue with vacations is of significance in certain practical cases. In this paper, we find various transient and steady-state results for the queue size, the delay times and the waiting times for the M/G/1 queue with controllable vacations. Finally, we also discuss optimal selection of the control parameter. 相似文献