New insights on the single machine total tardiness problem
dc.citation.epage | 89 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.spage | 82 | en_US |
dc.citation.volumeNumber | 48 | en_US |
dc.contributor.author | Tansel, B. C. | en_US |
dc.contributor.author | Sabuncuoğlu, İ. | en_US |
dc.date.accessioned | 2016-02-08T10:49:02Z | |
dc.date.available | 2016-02-08T10:49:02Z | |
dc.date.issued | 1997 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:49:02Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1997 | en |
dc.identifier.doi | 10.1057/palgrave.jors.2600321 | en_US |
dc.identifier.issn | 0160-5682 | |
dc.identifier.uri | http://hdl.handle.net/11693/25685 | |
dc.language.iso | English | en_US |
dc.publisher | Palgrave Macmillan | en_US |
dc.relation.isversionof | https://doi.org/10.1057/palgrave.jors.2600321 | en_US |
dc.source.title | Journal of the Operational Research Society | en_US |
dc.subject | Single machine scheduling | en_US |
dc.subject | Tardiness | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Computational complexity | en_US |
dc.subject | Dynamic programming | en_US |
dc.subject | Heuristic methods | en_US |
dc.subject | Machinery | en_US |
dc.subject | Optimization | en_US |
dc.subject | Single machine scheduling | en_US |
dc.subject | Single machine total tardiness problem | en_US |
dc.subject | Scheduling | en_US |
dc.title | New insights on the single machine total tardiness problem | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- New_insights_on_the_single_machine_total_tardiness_problem.pdf
- Size:
- 298.65 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version