Article ID: | iaor20164122 |
Volume: | 8 |
Issue: | 2 |
Start Page Number: | 79 |
End Page Number: | 93 |
Publication Date: | Nov 2016 |
Journal: | International Journal of Services Operations and Informatics |
Authors: | Chang FuMin, Wang TsungYin |
Keywords: | simulation, queues: applications |
In queueing system, when the server is idle, one of control policy for determining the timing of server activated is when a fixed number N of customers accumulates for service in the system. However, on some practical situations such as watching video file online, the threshold value N may vary depending on different situations. For such situation, this paper studies a random N‐policy Geo/G/1 queue, where N is determined as each new cycle begins. We derive some system characteristics, such as system size, idle period, busy period and sojourn time, by using the probability generating function and supplementary variable technique. We also prove that the system size of a continuous‐time random N‐policy M/G/1 queue can be approximated by the presented discrete‐time model.