Minimizing the Makespan

makespan

Link to original

$$q=\max \left(\frac{1}{m}\sum _{j=1}^m{p}_j,\underset{j\in [n]}{\max }(p_j)\right)$$

With release dates

model as Max Flow Problem

then use binary search to find $T$