Description:
<jats:p>We consider the design of index policies for admission and routing of soft real-time jobs to parallel queues, comparing three methods with respect to the average deadlinemiss costs incurred, based on individually optimal, policy improvement, and restless bandit indices.</jats:p>