JIMO
A heuristic algorithm for the optimization of M/M/$s$ queue with multiple working vacations
Chia-Huang Wu Kuo-Hsiung Wang Jau-Chuan Ke Jyh-Bin Ke
This paper focuses on an M/M/$s$ queue with multiple working vacations such that the server works with different service rates rather than no service during the vacation period. We show that this is a generalization of an M/M/1 queue with working vacations in the literature. Service times during vacation period, or during service period and vacation times are all exponentially distributed. We obtain the useful formula for the rate matrix $\textbf{R}$ through matrix-geometric method. A cost function is formulated to determine the optimal number of servers subject to the stability conditions. We apply the direct search algorithm and Newton-Quasi algorithm to heuristically find an approximate solution to the constrained optimization problem. Numerical results are provided to illustrate the effectiveness of the computational algorithm.
keywords: Newton-Quasi algorithm; optimization; rate matrix; sensitivity anal- ysis; working vacations.

Year of publication

Related Authors

Related Keywords

[Back to Top]