A note on generalizing the maximum lateness criterion for scheduling

This paper considers generalizing the objective criterion of minimizing maximum lateness in scheduling models. By isolating the properties of this objective function, it is able to show that certain approximation algorithms for the lateness model can be modified to handle a more general objective function, while preserving some performance guarantee. In particular, a special case of the more general criterion is minimizing the maximum weighted completion time of any job, and so the present results highlight the close resemblance this objective function bears to minimizing maximum lateness.