全文获取类型
收费全文 | 73篇 |
免费 | 0篇 |
专业分类
数学 | 73篇 |
出版年
2022年 | 1篇 |
2021年 | 2篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 4篇 |
2016年 | 4篇 |
2015年 | 1篇 |
2014年 | 4篇 |
2013年 | 3篇 |
2012年 | 1篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 4篇 |
2008年 | 1篇 |
2007年 | 1篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 5篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1996年 | 2篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1984年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有73条查询结果,搜索用时 93 毫秒
1.
2.
The G/M/1 queue is one of the classical models of queueing theory. The goal of this paper is two-fold: (a) To introduce new derivations
of some well-known results, and (b) to present some new results for the G/M/1 queue and its variants. In particular, we pay attention to the G/M/1 queue with a set-up time at the start of each busy period, and the G/M/1 queue with exceptional first service.
Dedicated to Arie Hordijk on his 65th birthday, in friendship and admiration. 相似文献
3.
We explore the relationship between the () inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the () model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period. 相似文献
4.
Raaijmakers Youri Albrecher Hansjörg Boxma Onno 《Methodology and Computing in Applied Probability》2019,21(4):1023-1044
Methodology and Computing in Applied Probability - We study a single server queue, where a certain type of dependence is introduced between the service times, or between the inter-arrival times, or... 相似文献
5.
In this paper we generalize known workload decomposition results for Lévy queues with secondary jump inputs and queues with server vacations or service interruptions. Special cases are polling systems with either compound Poisson or more general Lévy inputs. Our main tools are new martingale results, which have been derived in a companion paper. 相似文献
6.
This paper considers queues with server vacations, but departs from the traditional setting in two ways: (i) the queueing
model is driven by Lévy processes rather than just compound Poisson processes; (ii) the vacation lengths depend on the length
of the server’s preceding busy period. Regarding the former point: the Lévy process active during the busy period is assumed
to have no negative jumps, whereas the Lévy process active during the vacation is a subordinator. Regarding the latter point:
where in a previous study (Boxma et al. in Probab. Eng. Inf. Sci. 22:537–555, 2008) the durations of the vacations were positively correlated with the length of the preceding busy period, we now introduce
a dependence structure that may give rise to both positive and negative correlations. We analyze the steady-state workload of the resulting queueing (or: storage) system, by first considering
the queue at embedded epochs (viz. the beginnings of busy periods). We show that this embedded process does not always have
a proper stationary distribution, due to the fact that there may occur an infinite number of busy-vacation cycles in a finite
time interval; we specify conditions under which the embedded process is recurrent. Fortunately, irrespective of whether the
embedded process has a stationary distribution, the steady-state workload of the continuous-time storage process can be determined. In addition, a number of ramifications are presented. The theory is illustrated by several examples. 相似文献
7.
O.J. Boxma 《European Journal of Operational Research》1984,16(2):246-256
For the M/G/1 queue we study the joint distribution of the number of customers x present immediately before an arrival epoch and of the residual service time ζ of the customer in service at this epoch. The correlation coefficient ? (x, ζ) is shown to be positive (negative) when the service time distribution is DFR (IFR). The result for the joint distribution of x and ζ leads to the joint distribution of x, of the sojourn time s of the arriving customer and of the number of customers z left behind by this customer at his departure. ?(x, s), ?(z, s) and ?(x, z) are shown to be positive; ?(x, s) and ?(z, s) are compared in some detail.Subsequently the M/G/1 queue with finite capacity is considered; the joint distributions of x and ζ and of x and s are derived. These results may be used to study the cycle time distribution in a two-stage cyclic queue. 相似文献
8.
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems 总被引:1,自引:0,他引:1
We study two new cyclic reservation schemes for the efficient operation of systems consisting of a single server and multiple queues. The schemes are the Globally Gated regime and the Cyclic-Reservation Multiple-Access (CRMA). Both procedures possess mechanisms for prioritizing the queues and lend themselves to a closed-form analysis. The combination of these two properties allows for effective and efficient operation of the systems, for which we provide a thorough delay analysis and derive simple rules for optimal operation. 相似文献
9.
We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by a shot-noise process. A shot-noise rate emerges naturally in cases where the arrival rate tends to exhibit sudden increases (or shots) at random epochs, after which the rate is inclined to revert to lower values. Exponential decay of the shot noise is assumed, so that the queueing systems are amenable to analysis. In particular, we perform transient analysis on the number of jobs in the queue jointly with the value of the driving shot-noise process. Additionally, we derive heavy-traffic asymptotics for the number of jobs in the system by using a linear scaling of the shot intensity. First we focus on a one-dimensional setting in which there is a single infinite-server queue, which we then extend to a network setting. 相似文献
10.
We consider the GI/GI/1 queue with regularly varying service requirement distribution of index −α. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1−α, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index −α. That raises the question whether there exist service disciplines that give rise to a regularly varying sojourn time distribution
with any index −γ∈[−α,1−α]. In this paper that question is answered affirmatively. 相似文献