A two machine bicriteria scheduling problem

In this paper we consider the bicriteria problem of scheduling n jobs on two parallel machines to minimize the primary criterion of maximum tardiness (Tmax) and the secondary criterion of number of tardy jobs (NT). Algorithms are developed to optimize each of these criteria. Some properties on which the Tmax algorithm is based are developed. Computational experience with the algorithms is also reported.