A new lower bounding scheme for the total weighted tardiness problem
dc.citation.epage | 278 | en_US |
dc.citation.issueNumber | 4 | en_US |
dc.citation.spage | 265 | en_US |
dc.citation.volumeNumber | 25 | en_US |
dc.contributor.author | Selim Akturk, M. | en_US |
dc.contributor.author | Bayram Yildirim, M. | en_US |
dc.date.accessioned | 2016-02-08T10:45:29Z | |
dc.date.available | 2016-02-08T10:45:29Z | |
dc.date.issued | 1998 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | We propose a new dominance rule that provides a sufficient condition for local optimality for the 1∥Σw1Ti 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. © 1998 Elsevier Science Ltd, All rights reserved. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:45:29Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1998 | en |
dc.identifier.issn | 0305-0548 | |
dc.identifier.uri | http://hdl.handle.net/11693/25477 | |
dc.language.iso | English | en_US |
dc.source.title | Computers and Operations Research | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Computational methods | en_US |
dc.subject | Decision theory | en_US |
dc.subject | Problem solving | en_US |
dc.subject | Random number generation | en_US |
dc.subject | Lower bounding method | en_US |
dc.subject | Total weighted tardiness problem | en_US |
dc.subject | Scheduling | en_US |
dc.title | A new lower bounding scheme for the total weighted tardiness problem | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- A new lower bounding scheme for the total weighted tardiness problem.pdf
- Size:
- 993.5 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version