by E.R. Gafarov, A.A. Lazarev, F. Werner.
Series: 2010-12, Preprints
In this paper, we consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time.
Scheduling, Single machine problems, Maximization problems, Total tardiness