Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
This paper studies batch arrival MX/G/1 priority queues without and with (multiple or single) vacations. Applying the delay busy cycle analysis, we explicity derive the Laplace-Stieltjes transforms and the first two moments of the waiting time distributions for the nonpreemptive (head-of-the-line) and preemptive resume priority queues. Conservation laws for batch arrival systems are also mentioned. The results in this paper cover many previous results as special cases. © 1991.
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control