Recent Asymptotic Results in the Probabilistic Analysis of Schedule Makespans

Makespan scheduling problems are in the mainstream of operations research, industrialengineering, and computer science. A basic multiprocessor version requires that n tasks bescheduled on m identical processors so as to minimize the makespan, i.e., the latest taskfinishing time. In the standard probability model considered here, the task durations arei.i.d. random variables with a distribution F , and the objective is to estimate the distributionof the makespan as a function of m, n, and F ...