Minimizing the Mean Tardiness in A N1 Sequencing Problem

This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The results obtained reveals that the computational time and the required computer memory of the developed algorithm to provide a good solution are very low.