Derivation of the Expected Busy Period U sing its Pseudo Probability Density Function for a Controllable M/G/l Queueing Model Operating Under the Max (N, T, D) Policy

가상확률밀도함수를 사용하여 Max(N, T, D) 운5방침이 적용되는 조정가능한 M/G/1 대기모형의 busy period의 기대값 유도

  • Rhee, Hahn-Kyou (Department of Industrial and Management Engineering, Hannam University) ;
  • Oh, Hyun-Seung (Department of Industrial and Management Engineering, Hannam University)
  • 이한교 (한남대학교 산업경영공학과) ;
  • 오현승 (한남대학교 산업경영공학과)
  • Published : 2008.12.31

Abstract

The expected busy period for the controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy is derived by using a new concept so called "the pseudo probability density function." In order to justify the proposed approaches for the triadic policy, well-known expected busy periods for the dyadic policies are recovered from the obtained result as special cases.

Keywords

References

  1. Balachandran, K. R. and Tijms, H.; "On the D-policy for the M/G/1 Queue," Management Science, 9 : 1073- 1076, 1975
  2. Brill, P. H. and Harris, C. M.; "Waiting Timrs for M/G/1 Queues with Service Time or Delay-Dependent Server Vacations," Naval Research Logistics, 39 : 775- 787, 1992 https://doi.org/10.1002/1520-6750(199210)39:6<775::AID-NAV3220390604>3.0.CO;2-K
  3. Conolly, B.; Lecture Notes on Queueing Systems, Halsted, NY., 1975
  4. Gakis, K. G., Rhee, H. K., and Sivazlian, B. D.; "Distributions and First Moments of the Busy and Idle Periods in Controllable M/G/1 Queueing Models with Simple and Dyadic Policies," Stochastic Analysis and Applications, 13(1) : 47-81, 1995 https://doi.org/10.1080/07362999508809382
  5. Heyman, D.; "The T-policy for the M/G/1 Queue," Management Science, 23(7) : 775-778, 1977 https://doi.org/10.1287/mnsc.23.7.775
  6. Kella, O. and Yechiali, U.; "Priorities in M/G/1 Queue with Server Vacations," Naval Research Logistics, 35 : 23-34, 1988 https://doi.org/10.1002/1520-6750(198802)35:1<23::AID-NAV3220350103>3.0.CO;2-B
  7. Kella, O.; "The Threshold Policy in the M/G/1 Queue with Server Vacations," Naval Research Logistics, 36 : 111-123, 1989 https://doi.org/10.1002/1520-6750(198902)36:1<111::AID-NAV3220360109>3.0.CO;2-3
  8. Kleinrock, L.; Queueing Systems, Theory, John Wiley and Sons, New York, NY., 1 : 1975
  9. Rhee, H. K.; "Development of a New Methodology to find the Expected Busy Period for Controllable M/G/1 Queueing Models Operating under the Multivariable Operating Policies : Concepts and Application to the Dyadic Policies", 대한산업공학회지, 23(4) : 729-739, 1997
  10. Rhee, H. K.; "조정가능한 대기모형에 이변수 운용 방침(Dyadic Policy)이 적용될 때 busy period의 기 대값의 수리적 분석", 한남대학교 논문집, 32 : 141- 153, 2002
  11. Rhee, H. K. and Oh, H. S.; "삼변수 운용방침이 적 용되는 M/G/1 대기모형에서 가상확률밀도함수를 이 용한 busy period의 기대값 유도", 한국산업경영시스템학회지, 30(2) : 51-57, 2007
  12. Rhee, H. K. and Sivazlian, B. D.; "Distribution of the Busy Period in a Controllable M/M/2 Queue Operating under the Triadic (0, K, N, M) Policy," Journal of Applied Probability, 27 : 425-432, 1990 https://doi.org/10.2307/3214662
  13. Sivazlian, B. D. and Iyer, S. N.; "A Dyadic Age- Replacement Policy for a Periodically Inspected Equipment Items Subject to Random Deterioration," European Journal of Operational Research, 6 : 315-320, 1981 https://doi.org/10.1016/0377-2217(81)90236-8
  14. Teghem, J.; "Control of the Service Process in a Queueing System," European Journal of Operational Research, 23 : 141-158, 1986 https://doi.org/10.1016/0377-2217(86)90234-1
  15. Yadin, M. and Naor, P.; "Queueing System with Removable Service Station," Operational Research Quarterly, 14 : 93-405, 1963