P
Initializing...
§3, p. 5 — a schedule with makespan at most d is a feasible solution of (LP) with d_i = t = d · Prove2Me