Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan

What is it about?

The paper considers a single machine problem with release dates and identical processing times of the jobs. Algorithms for minimizing the makespan are analyzed, and two polynomial algorithms for minimizing maximum lateness as well as for constructing the Pareto set with respect to the criteria of minimizing maximum lateness and makespan are derived.

Featured Image