Single stage minimum absolute lateness problem with a common due date on non-identical machines

In this paper the authors consider scheduling n single operation jobs with a common due date on m non-identical machines (in parallel) so as to minimize the sum of the absolute lateness. They reduce the problem to a transformation problem that can be solved by a polynomial time algorithm. Furthermore, the authors consider the problem in the case of identical machines and they give a heuristic algorithm to minimize makespan among all schedules that minimize the absolute lateness problem.