What is it about?

The problem of scheduling n nonpreemptive jobs having a common due date on m, m ≥ 2, parallel identical machines to minimize total tardiness is studied. Approximability issues are discussed and two families of algorithms are presented.

Featured Image