期刊文献+

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 被引量:6

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. 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.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2017年第6期1382-1402,共21页 系统科学与复杂性学报(英文版)
基金 supported by the National Natural Science Foundation of China under Grant Nos.71571127and 71171138
关键词 Cost optimization departure process discrete-time queue Min(N V)-policy multiple server vacations Cost optimization, departure process, discrete-time queue, Min(N,V)-policy, multiple server vacations.
  • 相关文献

参考文献4

二级参考文献32

  • 1井彩霞,崔颖,田乃硕.Min(N,V)——策略休假的M/G/1排队系统分析[J].运筹与管理,2006,15(3):53-58. 被引量:29
  • 2Luo Chuanyi,Tang Yinghui,Liu Renbin.TRANSIENT SOLUTION FOR QUEUE-LENGTH DISTRIBUTION OF Geometry/G/1 QUEUEING MODEL[J].Applied Mathematics(A Journal of Chinese Universities),2007,22(1):95-100. 被引量:8
  • 3Tang Yinghui,Tang Xiaowo.Queueing Theory[M].Peking:Scientic Press,2006.
  • 4Cohen J W.The Single Server Queue[M].Amsterdam:North-Holland,1982.
  • 5Widder D V.The Laplace Transform[M].Princeton:Princeton University Press,1941.
  • 6Baba Y.On the Mx/G/1 queue with vacation time[J].O.R.Letters,1986,5:93--98.
  • 7Lee H S,Srinivasan M M.Control policies for the Mx/G/1 queueing system[J].Mgmt.Sci.,1989,35:708--721.
  • 8Ramaswami V.The N/G/1 queue and its detailed analysis[J].Adv.Appl.Proba.,1980,12:222--261.
  • 9Ali H.Expected number of departures in M/M/1 and GI/G/1 queues[J].Adv.Appl.Proba.,1990,22:770--772.
  • 10Chao X.On the departure processes of M/M/1/N and GI/G/1/N queues[J].Adv.Appl.Proba.,1992,24:751--753.

共引文献16

同被引文献35

引证文献6

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部