Scheduling algorithm which minimizes maximum lateness is optimal (it finds a feasible schedule, if one exists)

Question

I need to understand why if a scheduling algorithm A minimizes maximum lateness, then A is optimal (it finds a feasible schedule, if one exists).

I searched on the we