| Article ID: | iaor20108693 |
| Volume: | 62 |
| Issue: | 1 |
| Start Page Number: | 232 |
| End Page Number: | 237 |
| Publication Date: | Jan 2011 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Yoon S H, Lee I S |
This note considers the single-machine total weighted tardiness problem. Three new heuristic algorithms are suggested and compared with other competing heuristics from the literature, such as Apparent Tardiness Cost, Weighted Covert and Weighted Modified Due Date. The experimental tests show that the suggested heuristic algorithms outperform the existing heuristics.