A new dominance rule for the total weighted tardiness problem

dc.contributor.author	Akturk, M. Selim
dc.contributor.author	Yildirim, Mehmet Bayram
dc.date.accessioned	2011-03-22T20:29:59Z
dc.date.available	2011-03-22T20:29:59Z
dc.date.issued	1999
dc.identifier.issn	0953-7287
dc.identifier.uri	http://hdl.handle.net/10057/3449
dc.description	This 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.abstract	We 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.iso	en_US	en_US
dc.publisher	Taylor & Francis	en_US
dc.relation.ispartofseries	PRODUCTION PLANNING & CONTROL, 1999, VOL. 10, NO. 2, 138-149
dc.subject	Scheduling	en_US
dc.subject	Heuristics	en_US
dc.subject	Weighted tardiness	en_US
dc.title	A new dominance rule for the total weighted tardiness problem	en_US
dc.type	Article	en_US