Error bound for common due date assignment and job scheduling on parallel machines

We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical m achines so that the weighted sum of the due date, earliness and tardiness i s approximately minimized. We alter the heuristic slightly and show that th e revised version is asymptotically optimal as n --> infinity.