# Lawler's algorithm

The objective function is assumed to be in the form $min \, max_{0\le i \le n} \, g_i(F_i)$, where $g_i$ is any nondecreasing function and $F_i$ is the flow time.[2] When $g_i (F_i) = F_i - d_i = L_i$, the objective function corresponds to minimizing the maximum lateness, where $d_i$ is due time for job $i$ and $L_i$ lateness of job $i$. Another expression is $g_i (F_i) = max {(F_i-d_i,0)}$, which corresponds to minimizing the maximum tardiness.