Show simple item record

dc.contributor.authorAkturk, M. Selim
dc.contributor.authorYildirim, Mehmet Bayram
dc.date.accessioned2011-03-22T20:29:59Z
dc.date.available2011-03-22T20:29:59Z
dc.date.issued1999
dc.identifier.issn0953-7287
dc.identifier.urihttp://hdl.handle.net/10057/3449
dc.descriptionThis is the author's version of the work. It is posted here by permission of Taylor & Francis for personal use, not for redistribution. The definitive version was published in Production Planning & Control, Vol. 10, No. 2, 1999.
dc.description.abstractWe present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a su cient condition for local optimality. We show that if any sequence violates the dominance rule, then switching the violating jobs either lowers the total weighted tardiness or leaves it unchanged. We also develop a new algorithm based on the dominance rule, which is compared to a number of competing heuristics for a set of randomly generated problems. Our computational results of over 40000 problems indicate that the proposed algorithm dominates the competing heuristics in all runs.en_US
dc.language.isoen_USen_US
dc.publisherTaylor & Francisen_US
dc.relation.ispartofseriesPRODUCTION PLANNING & CONTROL, 1999, VOL. 10, NO. 2, 138-149
dc.subjectSchedulingen_US
dc.subjectHeuristicsen_US
dc.subjectWeighted tardinessen_US
dc.titleA new dominance rule for the total weighted tardiness problemen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record