New Insights on the Single Machine Total Tardiness Problem
本文用几何视角重新审视Emmons定理，为单机总延迟问题提供更简洁的表示，并区分易解与难解实例，对调度算法研究者有参考价值。
Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs.In this paper, we investigate these theorems with a geometric viewpoint.This approach provides a compact way of representing Emmons' theorems and promotes better insights into dominance properties.We use these insights to differentiate between certain classes of easy and hard instances.