Based on the number of customers and the server’s workload,this paper proposes a modified Min(N,D)-policy and discusses an M/G/1 queueing model with delayed randomized multiple vacations under such a policy.Applying ...Based on the number of customers and the server’s workload,this paper proposes a modified Min(N,D)-policy and discusses an M/G/1 queueing model with delayed randomized multiple vacations under such a policy.Applying the well-known stochastic decomposition property of the steady-state queue size,the probability generating function of the steady-state queue length distribution is obtained.Moreover,the explicit expressions of the expected queue length and the additional queue length distribution are derived by some algebraic manipulations.Finally,employing the renewal reward theorem,the explicit expression of the long-run expected cost per unit time is given.Furthermore,we analyze the optimal policy for economizing the expected cost and compare the optimal Min(N,D)-policy with the optimal N-policy and the optimal D-policy by using numerical examples.展开更多
In this paper the model of servicing machines with repairable facility is further studied.By standard conditioning decomposition argument,two reliability indices-the probability that the service facility fails at time...In this paper the model of servicing machines with repairable facility is further studied.By standard conditioning decomposition argument,two reliability indices-the probability that the service facility fails at time t and the expected number of failure occurring during（0,t] are discussed.Some important relations of them are given.Furthermore,some new reliability problems are presented and discussed as follows：1） The numbers of the service facility failures during the generalized service time and the generalized busy period;2） The asymptotic expansion of the expected failure number of the service facility during（0,t].A series of new reliability results of the service facility are obtained.展开更多
Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results ...Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.展开更多
基金supported by the National Natural Science Foundation of China(No.71571127)the National Natural Science Youth Foundation of China(No.72001181).
文摘Based on the number of customers and the server’s workload,this paper proposes a modified Min(N,D)-policy and discusses an M/G/1 queueing model with delayed randomized multiple vacations under such a policy.Applying the well-known stochastic decomposition property of the steady-state queue size,the probability generating function of the steady-state queue length distribution is obtained.Moreover,the explicit expressions of the expected queue length and the additional queue length distribution are derived by some algebraic manipulations.Finally,employing the renewal reward theorem,the explicit expression of the long-run expected cost per unit time is given.Furthermore,we analyze the optimal policy for economizing the expected cost and compare the optimal Min(N,D)-policy with the optimal N-policy and the optimal D-policy by using numerical examples.
基金Supported by the National Natural Science Foundation of China (No.70871084)the Specialized Research Fund for the Doctoral Profram of Higher Education of China (No.200806360001)
文摘In this paper the model of servicing machines with repairable facility is further studied.By standard conditioning decomposition argument,two reliability indices-the probability that the service facility fails at time t and the expected number of failure occurring during（0,t] are discussed.Some important relations of them are given.Furthermore,some new reliability problems are presented and discussed as follows：1） The numbers of the service facility failures during the generalized service time and the generalized busy period;2） The asymptotic expansion of the expected failure number of the service facility during（0,t].A series of new reliability results of the service facility are obtained.
基金Supported by the National Natural Science Foundation of China (No.70871084)Scientific Research Fund of Southwestern University of Finance and Economicsthe Specialized Research Fund for the Doctoral Program of Higher Education of China (No.200806360001)
文摘Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.
