The application of heuristic procedures for solving a real scheduling problem that arises in an autoparts factory is reported in this paper. Due to the characteristics of the environment, the measure of performance considered is the minimization of the total tardiness of the jobs. The original problem is reduced to the single machine scheduling problem, and the dispatching rules EDD (earliest due date), SPT (shortest processing time), and the PSK algorithm are used to obtain approximate solutions. Computational tests and a comparison with the usual schedule are presented.