서버상태의존 도착률을 갖는 M/G/l 모형의 최적 제어정책

Optimal N-Policy of M/G/1 with Server Set-up Time under Heterogeneous Arrival Rates

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.