We consider NP-hard scheduling problem on a single machine minimizing total tardiness on a single machine. We present a number of polynomial and pseudo-polynomial algorithms for special cases of the problem. Based on these algorithms, we give the algorithm that solves Event-Odd Partition problem in pseudo-polynomial time. This algorithm for Partition problem can handle instances with non-integer parameters.