Show simple item record

dc.contributor.authorTansel, B. Ç.en_US
dc.contributor.authorKara, B. Y.en_US
dc.contributor.authorSabuncuoğlu İ.en_US
dc.date.accessioned2016-02-08T10:34:56Z
dc.date.available2016-02-08T10:34:56Z
dc.date.issued2001en_US
dc.identifier.issn0740-817X
dc.identifier.urihttp://hdl.handle.net/11693/24828
dc.description.abstractThis paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job precedences, a simple optimality check, new decomposition theory, a new lower bound, and a check for presolved subproblems. These are integrated through the use of an equivalenceconcept that permits a continuous reformation of the data to permit early detection of optimality at the nodes of an enumeration tree. The overall effect is a significant reduction in the size of the search tree, CPU times, and storage requirements. The algorithm is capable of handling much larger problems (e.g., 500 jobs) than its predecessors in the literature (:s; 150). In addition, a simple modification of the algorithm gives a new heuristic which significantly outperforms the best known heuristics in the literature.en_US
dc.language.isoEnglishen_US
dc.source.titleIIE Transactions (Institute of Industrial Engineers)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1023/A:1010931215795en_US
dc.subjectAlgorithmsen_US
dc.subjectBoundary conditionsen_US
dc.subjectC (programming language)en_US
dc.subjectComputational complexityen_US
dc.subjectComputer simulationen_US
dc.subjectData structuresen_US
dc.subjectDynamic programmingen_US
dc.subjectJob analysisen_US
dc.subjectTheorem provingen_US
dc.subjectSearch treeen_US
dc.subjectSingle machine total tardiness problemen_US
dc.subjectSchedulingen_US
dc.titleAn efficient algorithm for the single machine total tardiness problemen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage661en_US
dc.citation.epage674en_US
dc.citation.volumeNumber33en_US
dc.citation.issueNumber8en_US
dc.identifier.doi10.1023/A:1010931215795en_US
dc.publisherTaylor & Francisen_US
dc.identifier.eissn1545-8830


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record