New constructive heuristics for the total weighted tardiness problem

Abstract

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.

Keywords:

• single-machine scheduling
• total weighted tardiness
• constructive heuristics

Acknowledgements

This study was supported by research funds from Dong-A University.