Show simple item record

dc.contributor.authorAkturk, M. Selim
dc.contributor.authorYildirim, Mehmet Bayram
dc.date.accessioned2011-03-22T20:29:49Z
dc.date.available2011-03-22T20:29:49Z
dc.date.issued1998
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/10057/3448
dc.identifier.urihttp://dx.doi.org/ 10.1016/S0305-0548(97)00073-7
dc.description"This is the author's version of the work. It is posted here by permission of Elsevier for personal use, not for redistribution. Accepted for publications to Computers and Operations Research,Vol. 25, No. 4, April 1, 1998 doi>10.1016/S0305-0548(97)00073-7 .WSU users can access the article via commercial databases licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1375035"
dc.description.abstractWe propose a new dominance rule that provides a sufficient condition for local optimality for the 1∥∑wiTi problem. We prove that if any sequence violates the proposed dominance rule, then switching the violating jobs either lowers the total weighted tardiness or leaves it unchanged. Therefore, it can be used in reducing the number of alternatives for finding the optimal solution in any exact approach. We introduce an algorithm based on the dominance rule, which is compared to a number of competing approaches for a set of randomly generated problems. We also test the impact of the dominance rule on different lower bounding schemes. Our computational results over 30,000 problems indicate that the amount of improvement is statistically significant for both upper and lower bounding schemes.en_US
dc.language.isoen_USen_US
dc.publisherElsevieren_US
dc.relation.ispartofseriesComputers Ops Res. Vol. 25, No.4, pp. 265-278, 1998;
dc.titleA new lower bounding scheme 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