Show simple item record

dc.contributor.authorAktürk, M. S.en_US
dc.contributor.authorÖzdemir, D.en_US
dc.date.accessioned2016-02-08T10:36:57Z
dc.date.available2016-02-08T10:36:57Z
dc.date.issued2000en_US
dc.identifier.issn0740-817X
dc.identifier.urihttp://hdl.handle.net/11693/24967
dc.description.abstractThe study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound algorithm. The proposed algorithm is tested on a set of randomly generated problems with 10, 15 and 20 jobs. To the best of our knowledge, this is the first exact approach that attempts to solve the σwjTjproblem. © 2000 "IIE".en_US
dc.language.isoEnglishen_US
dc.source.titleIIE Transactions (Institute of Industrial Engineers)en_US
dc.relation.isversionofhttps://doi.org/10.1023/A:1013741325877en_US
dc.subjectAlgorithmsen_US
dc.subjectProblem solvingen_US
dc.subjectSchedulingen_US
dc.subjectTotal weighted tardinessen_US
dc.subjectJob analysisen_US
dc.titleAn exact approach to minimizing total weighted tardiness with release datesen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineering
dc.citation.spage1091en_US
dc.citation.epage1101en_US
dc.citation.volumeNumber32en_US
dc.citation.issueNumber11en_US
dc.identifier.doi10.1023/A:1013741325877en_US
dc.publisherKluwer Academic Publishersen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record