Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

We give lower bounds for the competitivity of online algorithms and propose algorithms which match this lower bound up to a constant factor.