Steady-state analysis of a discrete-time batch arrival queue with working vacations
โ Scribed by Ji-hong Li; Wei-qi Liu; Nai-shuo Tian
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 773 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0166-5316
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 sys
## Abstract This paper studies the operating characteristics of the variant of an M^[x]^/G/1 vacation queue with startup and closedown times. After all the customers are served in the system exhaustively, the server shuts down (deactivates) by a closedown time, and then takes at most __J__ vacation