Diffusion approximation for queueing systems with nonexhaustive cyclic service

In queueing models with nonexhaustive cyclic service, a specified maximum number of jobs in the queue, denoted by K, will be served upon the arrival of the server. This paper presents an approximation method for deriving the mean waiting time of GI[x]/G/1 systems with nonexhaustive cyclic service, using diffusion approximation and an iterative method. By use of proposed method, some performance measures for general case (with arbitrary K and non-symmetrical) can be evaluated. Numerical results are shown and compared with existing results and also with computer simulations. [In Japanese.]