Tansel, B. C.Sabuncuoğlu, İ.2016-02-082016-02-0819970160-5682http://hdl.handle.net/11693/25685Virtually 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.EnglishSingle machine schedulingTardinessAlgorithmsComputational complexityDynamic programmingHeuristic methodsMachineryOptimizationSingle machine schedulingSingle machine total tardiness problemSchedulingArticle10.1057/palgrave.jors.2600321