Minimizing Total Weighted Tardiness on Single Machine

Abstract

This paper considers a single machine total weighted tardiness scheduling problem. Total weighted tardiness scheduling problem is proven to be NP-hard and cannot be solved in a reasonable time for large size problem. A metaheuristic which is genetic algorithm is developed to solve such scheduling problem in this paper. Besides that, dispatching heuristics are also developed which serves as an initial solution to genetic algorithm. The developed genetic algorithm has the capability to provide good results and good improvement compared to dispatching heuristics.