A new lower bounding scheme for the total weighted tardiness problem

Loading...
Thumbnail Image
Authors
Akturk, M. Selim
Yildirim, Mehmet Bayram
Issue Date
1998
Type
Article
Language
en_US
Keywords
Research Projects
Organizational Units
Journal Issue
Alternative Title
Abstract

We 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.

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"
Citation
Publisher
Elsevier
License
Journal
Volume
Issue
PubMed ID
DOI
ISSN
0305-0548
EISSN
Collections