, Volume 16, Issue 5, pp 539-547,
Open Access This content is freely available online to anyone, anywhere at any time.
Date: 12 Sep 2012

Lower bounds for online makespan minimization on a small number of related machines


In online makespan minimization, the jobs characterized by their processing time arrive one-by-one and each has to be assigned to one of the m uniformly related machines. The goal is to minimize the length of the schedule. We prove new combinatorial lower bounds for m=4 and m=5, and computer-assisted lower bounds for m≤11.