The Structure of Departure Process and Optimal Control Strategy N* for Geo/G/1 Discrete-Time Queue with Multiple Server Vacations and Min(N, V)-Policy

摘要

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.