Preemptive scheduling to minimize mean weighted flow time

We give an On 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 general problem of minimizing the mean weighted flow time ...

A set of jobs has to be scheduled on parallel uniform machines. Each machine can handle at most one job at a time. Each job becomes available for processing at its release date. All jobs have the same execution requirement, and each machine has a known ...

• Single machine.
• Bi-criterion scheduling with preemption and two weights.

In this paper, we consider the single-machine bi-criteria preemptive scheduling for minimizing the total weighted late work and the weighted number of tardy jobs, where weights of the jobs for the two criteria are independent, and so, ...