DOI QR코드

DOI QR Code

Upper and Lower Bounds of the Expected Busy Period for the Triadic Med(N, T, D) Policy

삼변수 Med(N, T, D) 운용방침에 따른 Busy Period 기대값의 상한과 하한 유도

  • Received : 2013.01.21
  • Accepted : 2013.02.04
  • Published : 2013.03.31

Abstract

Using the known result of the expected busy period for the triadic Med (N, T, D) operating policies applied to a controllable M/G/1 queueing model, its upper and lower bounds are derived to approximate its corresponding actual values. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) or Max (N, T), Max (N, D) and Max (T, D) with the simple N, T and D operating policies without using any other types of triadic operating policies such as Min (N, T, D) and Max (N, T, D) policies. All three input variables N, T and D are equally contributed to construct such bounds for estimation of the expected busy period.

Acknowledgement

Supported by : Hannam University

References

  1. Balachandran, K.R. and Tijms, H, On the D-policy for the M/G/1 Queue, Management Science. 1975, Vol. 9, p 1073-1076.
  2. Conolly, B., Lecture Notes on Queueing Systems. Halsted, New York, 1975.
  3. 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, 1995, Vol. 13, No. 1, p 47-81. https://doi.org/10.1080/07362999508809382
  4. Heyman, D., The T-policy for the M/G/1 Queue. Management Science, 1977, Vol. 23, No. 7, p 775-778.
  5. Kleinrock, L., Queueing Systems, Vol. 1 : Theory. John Wiley and Sons, New York, NY, 1975.
  6. Rhee, H.K., Development of a New Methodology to find the Expected Busy Period for Controllable M/G/1 Queueing Models Operating under the Multi-variable Operating Policies : Concepts and Application to the Dyadic Policies. Journal of the Korean Institute of Industrial Engineers, 1997, Vol. 23, No. 4, p 729-739.
  7. Rhee, H.K. and Oh, H.S., Derivation of Upper and Lower Bounds of the Expected Busy Periods for Min(N, D) and Max(N, D) Operating Policies in a Controllable M/G/1 Queueing Model. Journal of the Society of Korea Industrial and Systems Engineering, 2009, Vol. 32, No. 3, p 71-77.
  8. Rhee, H.K. and Oh, H.S., Development of the Most Generalized Form of the Triadic Operating Policy and Derivation of its Corresponding Expected Busy Period. Journal of the Society of Korea Industrial and Systems Engineering, 2009, Vol. 32, No. 4, p 161-168.
  9. Rhee, H.K., Construction of a Relation Between the Triadic Min(N, T, D) and Max(N, T, D) Operating Policies Based on their Corresponding Expected Busy Period. Journal of the Society of Korea Industrial and Systems Engineering, 2010, Vol. 33, No. 3, p 63-70.
  10. Rhee, H.K., Derivation of Upper and Lower Bounds of the Expected Busy Period for a Controllable M/G/1 Queueing Model Operating under the Triadic Max(N, T, D). Journal of the Society of Korea Industrial and Systems Engineering, 2011, Vol. 34, No. 1, p 67-73.
  11. Rhee, H.K., Decomposition of the Most Generalized Triadic Operating policy Using its Corresponding Expected Busy. Journal of the Society of Korea Industrial and Systems Engineering, 2011, Vol. 34, No. 4, p 162-168.
  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, 1990, Vol. 27, p 425-432. https://doi.org/10.2307/3214662
  13. Teghem, J., Control of the Service Process in a Queueing System. European Journal of Operational Research, 1986, Vol. 23, p 141-158. https://doi.org/10.1016/0377-2217(86)90234-1
  14. Yadin, M. and Naor, P., Queueing System with Removable Service Station. Operational Research Quarterly, 1963, Vol. 14, p 393-405. https://doi.org/10.1057/jors.1963.63