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

Batch arrival queue with N-policy and at most J vacations

โœ Scribed by Jau-Chuan Ke; Hsin-I Huang; Yunn-Kuang Chu

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
402 KB
Volume
34
Category
Article
ISSN
0307-904X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Two thresholds of a batch arrival queuei
Two thresholds of a batch arrival queueing system under modified T vacation policy with startup and closedown
โœ Jau-Chuan Ke ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 205 KB

## 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

Maximum entropy approach for batch-arriv
Maximum entropy approach for batch-arrival queue under policy with an un-reliable server and single vacation
โœ Jau-Chuan Ke; Chuen-Horng Lin ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 342 KB

We consider the M [x] /G/1 queueing system, in which the server operates N policy and a single vacation. As soon as the system becomes empty the server leaves for a vacation of random length V . When he returns from the vacation and the system size is greater than or equal to a threshold value N , h