摘要

We consider a 2-class, single-server, preemptive priority queueing model in which the high-priority customers form a classical M/M/1 queue, while the low-priority customers form the so-called Israeli Queue with at most N different groups and unlimited-size batch service. We provide an extensive probabilistic analysis and calculate key performance measures. Special cases are analyzed and numerical examples are presented and discussed.

  • 出版日期2013-7-3