Before revision: We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a.  the makespan).
After revision: We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a. \ the makespan).