What is it about?

This conference paper gives fully polynomial time approximation schemes to solve five single machine total tardiness problems approximately. They are based on the graphical algorithm resulting from a modification of dynamic programming.

Featured Image

Read the Original

This page is a summary of: A Graphical Approach for Solving Single Machine Scheduling Problems Approximately, IFAC Proceedings Volumes, January 2013, Elsevier,
DOI: 10.3182/20130619-3-ru-3018.00010.
You can read the full text:

Read

Contributors

The following have contributed to this page