A bicriteria scheduling problem with earliness and tardiness penalties

In this paper, we study the problem of scheduling n jobs on a single machine to minimize the total earliness penalties subject to a maximum tardiness penalty of each job. From the viewpoint of multicriteria scheduling, the problem is different from the E/T scheduling problems mostly studied in the literature. A heuristic algorithm and a branch and bound algorithm are proposed, computational results are reported.<<ETX>>