×

The effect of different arrival rates on the \(N\)-policy of M/G/1 with server setup. (English) Zbl 0957.90031

Summary: It is very important in many real-life systems to decide when the server should start his service because frequent setups inevitably make the operating cost too high. Furthermore, today’s systems are too intelligent for the input to be assumed as a simple homogeneous Poisson process. In this paper, an M/G/1 queue with general server setup time under a control policy is studied. We consider the case when the arrival rate varies according to the server’s status: idle, setup and busy states. We derive the distribution function of the steady-state queue length, as well as the Laplace-Stieltjes transform of waiting time. For this model, the optimal \(N\)-value from which the server starts his setup is found by minimizing the total operation cost of the system. We finally investigate the behavior of system operation cost and the optimal \(N\) for various arrival rates by a numerical study.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI

References:

[1] Yadin, M.; Naor, P., Queueing systems with a removable server station, Oper. Res. Quart., 14, 393-405 (1963)
[2] S.S. Lee, Operating characteristics of bulk queues with threshold and vacations. Ph.D. Dissertation, Sung Kyun Kwan University, Korea, 1993; S.S. Lee, Operating characteristics of bulk queues with threshold and vacations. Ph.D. Dissertation, Sung Kyun Kwan University, Korea, 1993
[3] Lee, H. W.; Lee, S. S.; Chae, K. C., Operating Characteristics of \(M^X\)/G/1 queue with N-policy, Queueing Systems, 15, 387-399 (1994) · Zbl 0789.60081
[4] Igaki, N., Exponential two server queue with \(N\)-policy and general vacations, Queueing Systems, 10, 279-294 (1992) · Zbl 0786.60115
[5] Minh, D. L., Transient solutions for some exhaustive M/G/1 queues with generalized independent vacations, European J. Oper. Res., 36, 197-201 (1988) · Zbl 0649.60099
[6] Medhi, J.; Templeton, G. C., A Poisson input queue under \(N\)-policy and with a general start-up time, Comput. Ops. Res., 19, 34-41 (1992) · Zbl 0742.60100
[7] Lee, H. W.; Park, J. O., Optimal strategy in \(N\)-policy system with early set-up, J. Ops. Res. Soc., 47, 1-8 (1996)
[8] R.B. Cooper, Introduction to queueing theory. 3rd ed. CEE Press Books, 1990, pp. 228-232; R.B. Cooper, Introduction to queueing theory. 3rd ed. CEE Press Books, 1990, pp. 228-232
[9] H. Takagi, Queueing Analysis: A foundation of performance evaluation. 1, North-Holland, 1991, pp. 23-28; H. Takagi, Queueing Analysis: A foundation of performance evaluation. 1, North-Holland, 1991, pp. 23-28 · Zbl 0744.60114
[10] Fuhrmann, S. W.; Cooper, R. B., Stochastic decompositions in the M/G/1 queue with generalized vacations, Ops. Res., 33, 1117-1129 (1985) · Zbl 0585.90033
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.