Bicriterion scheduling of identical processing time jobs by uniform processors

Two problems of bicriterion scheduling of jobs with identical processing times by uniform processors are considered. The first criterion is the minimization of maximum cost with different cost functions, while the second criterion is the minimization of either total or maximum costs. Polynomial time algorithms are presented to determine all efficient solutions for both problems.