A Study on times to the First Overflow in M/G/1/K/N Queueing Systems

  • Lee, Kyu-Noh (Senior Researcher, Agency for Degense Development) ;
  • Kim, Hong-Gie (Associate Professor, Department of Statistics, Chungnam National University)
  • Published : 1999.12.01

Abstract

The main purpose of queueing theory is to find the optimal solution for maintaining systems such as service facilities. Analyzing the overfolw process provides an important information for the solution in queueing systems with finite capacity. In this thesis we approximate the expected time until the first overflow in M/G/1/K/N queueing systems. Results will be applied to approximate the expected time until the first reduction of source population system. Simulation results show that our approximation is applicable to real situations.

Keywords

References

  1. Metrika v.22 Imbedded Markov Chains in Queueings M/G/1 and GI/M/1 with Limited Waiting Room Bhat, U.N.
  2. Basic Queueing Theory Bunday, B.D.
  3. The Single Server Queue Cohen, J.W.
  4. Mathematics of Operations Research v.6 no.4 Distribution of the inter overflow time for the GI/G/1 loss system Halfin, S.
  5. Priority Queues Jaiswal, N.K.
  6. Elements of Queueing Theory with Applications Saaty, T.L.
  7. Handbook of Industrial Engineering Machine interference: the assignment of machines to operators Stecke, K.E.;Salvendy, G.
  8. International Journal of Production Research v.23 no.1 Review of operator/machine interference model Steke, K.E.;Aronson, J.E.
  9. Queueing Analysis: Volume 2, Finite Systems Takagi, H.
  10. Journal of Applied Probability v.30 no.2 Analysis of an M/G/1/K/N Queue Takine, T.;Takagi, H.;Hasegawa, T.