by E.R. Gafarov, A.A. Lazarev, F. Werner.
Series: 2010-10, Preprints
In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. An NP-hardness proof and a pseudo-polynomial time solution algorithm are proposed for a special case of this problem.
Scheduling, Single machine, Total tardiness, Number of tardy jobs, Complexity, Pseudo-polynomial algorithm