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
โฆ LIBER โฆ
Optimal NT policies for M/G/1 system with a startup and unreliable server
โ Scribed by Jau-Chuan Ke
- Book ID
- 108094639
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 453 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0360-8352
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
On M/G/1 system under NT policies with b
โ
Jau-Chuan Ke
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 215 KB
Optimal control of the N policy M/G/1 qu
โ
Kuo-Hsiung Wang; Tsung-Yin Wang; Wen Lea Pearn
๐
Article
๐
2007
๐
Elsevier Science
๐
English
โ 268 KB
Optimization of the T policy M/G/1 queue
โ
Tsung-Yin Wang; Kuo-Hsiung Wang; Wen Lea Pearn
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 667 KB
This paper investigates the T policy M/G/1 queue with server breakdowns, and startup times. Customers arrive at the system according to a Poisson process. Service times, repair times, and startup times are assumed to be generally distributed. The server is turned on after a fixed length of time T re
Comparative analysis for theNpolicy M/G/
โ
Kuo-Hsiung Wang; Li-Ping Wang; Jau-Chuan Ke; Gang Chen
๐
Article
๐
2005
๐
Springer
๐
English
โ 294 KB
An M[x]/G/1 system with startup server a
โ
Jau-Chuan Ke
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 233 KB