The paper deals with a Geom/Geom/1 queue with set-up time and N-policy and working vacation in which customers are either “positive” or “negative”. The vacation policy is exhaustive service and multiple working vacation. The server works at a lower rate during the working vacation rather than stop working. Negative customers remove positive customers only one by one at the head (if present). When a negative customer arrives, if the system is empty, it will disappear. Negative customers need no services. Using QBD (quasi birth and death) process and matrix-geometric solution, we obtain the steady state distributions for the number of customers in the system and prove the result of stochastic decomposition of the queue length. Furthermore, we gain the mean of the system size of positive customers. Finally, we provide some numerical examples to illustrate the effect of the parameters such as starting rate and negative customer arrival rate on steady-state queue length.
ZHU Sha, ZHU Yijun ,WANG Fengjia.
GEOM/GEOM/1 QUEUE WITH WORKING VACATIONS AND N-POLICY AND SET-UP TIME AND NEGATIVE CUSTOMERS. Journal of Systems Science and Mathematical Sciences, 2012, 32(1): 36-44 https://doi.org/10.12341/jssms11771