What is it about?
The paper presents an exact algorithm for solving the problem of scheduling a set of jobs on a single machine to maximize total tardiness.
Featured Image
Why is it important?
The allpication of a graphival algorithm turns a pseudo-polynomial standard dynamic programming algorithm into a polynomial one of quadratic complexity.
Read the Original
This page is a summary of: Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one, Annals of Operations Research, January 2012, Springer Science + Business Media,
DOI: 10.1007/s10479-011-1055-4.
You can read the full text:
Contributors
The following have contributed to this page
