DOI QR코드

DOI QR Code

Analysis of a Controllable Queueing Model Operating under the Alternating Operating Policies

변동 운용방침이 적용되는 조정가능한 대기모형 분석

  • Received : 2016.01.13
  • Accepted : 2016.03.05
  • Published : 2016.03.31

Abstract

Different from general operating policies to be applied for controllable queueing models, two of three well-known simple N, T and D operating policies are applied alternatingly to the single server controllable queueing models, so called alternating (NT), (ND) and (TD) policies. For example, the alternating (ND) operating policy is defined as the busy period is initiated by the simple N operating policy first, then the next busy period is initiated by the simple D operating policy and repeats the same sequence after that continuously. Because of newly designed operating policies, important system characteristic such as the expected busy and idle periods, the expected busy cycle, the expected number of customers in the system and so on should be redefined. That is, the expected busy and idle periods are redefined as the sum of the corresponding expected busy periods and idle periods initiated by both one of the two simple operating policies and the remaining simple operating policy, respectively. The expected number of customers in the system is represented by the weighted or pooled average of both expected number of customers in the system when the predetermined two simple operating policies are applied in sequence repeatedly. In particular, the expected number of customers in the system could be used to derive the expected waiting time in the queue or system by applying the famous Little's formulas. Most of such system characteristics derived would play important roles to construct the total cost functions per unit time for determination of the optimal operating policies by defining appropriate cost elements to operate the desired queueing systems.

Keywords

References

  1. Artalejo, J.R., On the M/G/1 Queue with D-policy, Applied Mathematical Modelling, 2001, Vol. 25, No. 12, pp. 1055-1069. https://doi.org/10.1016/S0307-904X(01)00031-2
  2. Balachandran, K.R. and Tijms, H., On the D-policy for the M/G/1 Queue, Management Science, 1975, Vol. 9, pp. 1073-1076.
  3. Conolly, B., Lecture Notes on Queueing Systems, Halsted, New York, 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, 1995, Vol. 13, No. 1, pp. 47-81. https://doi.org/10.1080/07362999508809382
  5. Ham T.J. and Song T.Y., Structural Analysis for an Optimum Maintenance Policy, Journal of the Korean Institute of Plant Engineering, 2001, Vol. 6, No. 4, pp. 31-43.
  6. Heyman, D., The T-policy for the M/G/1 Queue, Management Science, 1977, Vol. 23, No. 7, pp. 775-778. https://doi.org/10.1287/mnsc.23.7.775
  7. Kleinrock, L., Queueing Systems, Vol. 1 : Theory, John Wiley and Sons, New York, NY, 1975.
  8. Li, Jingwen and Niu, Shun-Chen, The waiting-time Distribution for GI/G/1 Queue under the D-Policy, Probability in the Engineering and Information Science, 1992, Vol. 6, pp. 287-308. https://doi.org/10.1017/S0269964800002552
  9. Moon, G.J. and Kim, M.Y., Optimization of Delivery Facility Operation under Restricted Conditions, Journal of the Korean Institute of Plant Engineering, 2005, Vol. 10, No. 1, pp. 5-17.
  10. 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, pp. 71-77.
  11. 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, pp. 161-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, pp. 425-432. https://doi.org/10.2307/3214662
  13. 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, pp. 63-70.
  14. 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, pp. 162-168.
  15. 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, pp. 67-73.
  16. 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, pp. 729-739.
  17. Rhee, H.K., System analysis of a Controllable Queueing Model Operating under the {T:Min(T, N)} Policy, Journal of the Society of Korea Industrial and Systems Engineering, 2015, Vol. 38, No. 1, pp. 21-29. https://doi.org/10.11627/jkise.2014.38.1.21
  18. Teghem, J., Control of the Service Process in a Queueing System, European Journal of Operational Research, 1986, Vol. 23, pp. 141-158. https://doi.org/10.1016/0377-2217(86)90234-1
  19. Yadin, M. and Naor, P., Queueing System with Removable Service Station, Operational Research Quarterly, 1963, Vol. 14, pp. 393-405. https://doi.org/10.1057/jors.1963.63