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

Abstrakt

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.

Klíčová slova

• Online algorithms
• Scheduling
• Makespan
• Related machines