We consider the problem of scheduling n preemptive jobs with deadlines on m identical parallel machines so as to minimize total completion time. We show that the problem is polynomially solvable when the processing times and deadlines are agreeable.
