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.展开更多
This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. U...This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.展开更多
This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the...This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D,whichever occurs first(Min(N,D)-policy).By using renewal process theory and total probability decomposition technique,the authors study the transient and equilibrium properties of the queue length from the beginning of the arbitrary initial state,and obtain both the recursive expression of the z-transformation of the transient queue length distribution and the recursive formula for calculating the steady state queue length at arbitrary time epoch n^+.Meanwhile,the authors obtain the explicit expressions of the additional queue length distribution.Furthermore,the important relations between the steady state queue length distributions at different time epochs n^-,n and n^+ are also reported.Finally,the authors give numerical examples to illustrate the effect of system parameters on the steady state queue length distribution,and also show from numerical results that the expressions of the steady state queue length distribution is important in the system capacity design.展开更多
基金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 under Grant Nos.71571127and 71171138
文摘This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.
基金supported by the National Natural Science Foundation of China under Grant Nos.71171138,71301111,71571127the Scientific Research Innovation&Application Foundation of Headmaster of Hexi University under Grant Nos.XZ2013-06,XZ2013-09
文摘This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D,whichever occurs first(Min(N,D)-policy).By using renewal process theory and total probability decomposition technique,the authors study the transient and equilibrium properties of the queue length from the beginning of the arbitrary initial state,and obtain both the recursive expression of the z-transformation of the transient queue length distribution and the recursive formula for calculating the steady state queue length at arbitrary time epoch n^+.Meanwhile,the authors obtain the explicit expressions of the additional queue length distribution.Furthermore,the important relations between the steady state queue length distributions at different time epochs n^-,n and n^+ are also reported.Finally,the authors give numerical examples to illustrate the effect of system parameters on the steady state queue length distribution,and also show from numerical results that the expressions of the steady state queue length distribution is important in the system capacity design.
