We consider the problem of dynamic admission control in a multi-class Markovian loss system receiving random batches, where each admitted class-i job demands an exponential service with rate @m, and brings a reward r"i. We show that the optimal admission policy is a sequential threshold policy with monotone thresholds.
['E. Lerzan Örmeci', 'Apostolos Burnetas']
Admission control with batch arrivals