An 0(n log mn) algorithm is presented to preemptively schedule n tasks on m identical machines. The tasks are assumed to have due dates. All tasks are initially available. The objective is to obtain a ...