What is it about?
This paper deals with the complexity and some algorithms for the problem of maximizing total tardiness on a single machine.
Featured Image
Why is it important?
New complexity results for single machine scheduling problems are given.
Read the Original
This page is a summary of: Single machine total tardiness maximization problems: complexity and algorithms, Annals of Operations Research, December 2012, Springer Science + Business Media,
DOI: 10.1007/s10479-012-1288-x.
You can read the full text:
Contributors
The following have contributed to this page
