๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal (d, c) vacation policy for a finite buffer M/M/c queue with unreliable servers and repairs

โœ Scribed by Jau-Chuan Ke; Chuen-Horng Lin; Jyun-Yi Yang; Zhe George Zhang


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
976 KB
Volume
33
Category
Article
ISSN
0307-904X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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