Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Charles Micchelli
Journal of Approximation Theory