We consider aMX/G/1 queueing system withN-policy. The server is turned off as soon as the system empties. When the queue length reaches or exceeds a predetermined valueN (threshold), the server is turned on and begins to serve the customers. We place our emphasis on understanding the operational characteristics of the queueing system. One of our findings is that the system size is the sum of two independent random variables: one has thePGF of the stationary system size of theMX/G/1 queueing system withoutN-policy and the other one has the probability generating function ∑j=0N=1 πjzj/∑j=0N=1 πj, in which πj is the probability that the system state stays atj before reaching or exceedingN during an idle period. Using this interpretation of the system size distribution, we determine the optimal thresholdN under a linear cost structure.
[1]
이효성.
제어운영 정책하에 있는 집단으로 도착하는 서어버 휴가모형의 안정상태확률 ( Steady State Probabilities for the Server Vacation Model with Group arrivals and under Control-operating Policy )
,
1991
.
[2]
P. J. Burke.
Technical Note - Delays in Single-Server Queues with Batch Input
,
1975,
Oper. Res..
[3]
Mandyam M. Srinivasan,et al.
Control policies for the M X /g/ 1 queueing system
,
1989
.
[4]
M. Yadin,et al.
Queueing Systems with a Removable Service Station
,
1963
.
[5]
Ronald W. Wolff,et al.
Poisson Arrivals See Time Averages
,
1982,
Oper. Res..