Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Interrelationship between controlling arrival and service in queueing systems
Computers and Operations Research
Duality relations for queues with arrival and service control
Computers and Operations Research
M/M/1 queues with working vacations (M/M/1/WV)
Performance Evaluation
M/G/1 queue with multiple working vacations
Performance Evaluation
Analysis of a GI/M/1 queue with multiple working vacations
Operations Research Letters
A queue with working breakdowns
Computers and Industrial Engineering
| Hi-index | 7.29 |
This paper analyzes the F-policy M/M/1/K queueing system with working vacation and an exponential startup time. The F-policy deals with the issue of controlling arrivals to a queueing system, and the server requires a startup time before allowing customers to enter the system. For the queueing systems with working vacation, the server can still provide service to customers rather than completely stop the service during a vacation period. The matrix-analytic method is applied to develop the steady-state probabilities, and then obtain several system characteristics. We construct the expected cost function and formulate an optimization problem to find the minimum cost. The direct search method and Quasi-Newton method are implemented to determine the optimal system capacity K, the optimal threshold F and the optimal service rates (@m"B,@m"V) at the minimum cost. A sensitivity analysis is conducted to investigate the effect of changes in the system parameters on the expected cost function. Finally, numerical examples are provided for illustration purpose.