Modified T vacation policy for an M/G/1
โ
Jau-Chuan Ke
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 645 KB
This paper studies the vacation policy of an M/G/1 queueing system with an unreliable server and startup. After all the customers are served in the queue exhaustively, the server deactivates and takes at most J vacations of constant time length T repeatedly until at least one customer is found waiti