What is it about?

This paper gives polynomial time algorithms for subclasses of the single machine scheduling problem of minimizing total tardiness.

Featured Image

Read the Original

This page is a summary of: Algorithms for special cases of the single machine total tardiness problem and an application to the even–odd partition problem, Mathematical and Computer Modelling, May 2009, Elsevier,
DOI: 10.1016/j.mcm.2009.01.003.
You can read the full text:

Read

Contributors

The following have contributed to this page