Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling

Abstract

Abstract Kanet addressed the problem of scheduling n jobs on one machine so as to minimize the sum of absolute lateness under a restrictive assumption on their common due date. This article extends the results to the problem of scheduling n jobs on m parallel identical processors in order to minimize the sum of absolute lateness. Also, a heuristic algorithm for a more general version with no restriction on the common due date, for the problem of n ‐job single‐machine scheduling is presented and its performance is reported.