Dynamic programming and decomposition approaches for the single machine total tardiness problem
The problem of sequencing jobs on a single machine to minimize total tardiness is considered. General precedence constrained dynamic programming algorithms and special-purpose decomposition algorithms are presented. Computational results for problems with up to 100 are given.
scientific article; zbMATH DE number 4020834