New insights on the single machine total tardiness problem
Date
1997
Authors
Tansel, B. C.
Sabuncuoğlu, İ.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
30
downloads
downloads
Citation Stats
Series
Abstract
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.
Source Title
Journal of the Operational Research Society
Publisher
Palgrave Macmillan
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English