We study the problem of obtaining feasible preemptive schedules for independent jobs. It is assumed that each job has associated with it a release and due time. No job can begin before its release ...

We give an O(n log n) time algorithm to preemptively schedule n equal-length jobs with release times on two identical, parallel machines so as to minimize the mean flow time. The complexity of the ...