New insights on the single machine total tardiness problem

Creative Commons License

Tansel B., Sabuncuoglu İ.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.48, sa.1, ss.82-89, 1997 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 48 Sayı: 1
  • Basım Tarihi: 1997
  • Doi Numarası: 10.1057/palgrave.jors.2600321
  • Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.82-89
  • Abdullah Gül Üniversitesi Adresli: Hayır

Özet

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.