A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines

We consider the scheduling of multiclass jobs with deadlines to the completion of their service. Deadlines are deterministic and job arrivals in each class occur at the times of deadline expirations in the respective class. Assuming geometric service times with class dependent means, we derive structural properties of preemptive server allocation policies that maximize the expected number of job completions. Our work extends results that have appeared in the real‐time wireless scheduling literature.