A Graphical Approach for Solving Single Machine Scheduling Problems Approximately

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