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.

[1]  Sartaj Sahni,et al.  Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..

[2]  Joseph Naor,et al.  New algorithms for related machines with temporary jobs , 2000 .

[3]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[4]  Rudolf Fleischer,et al.  On‐line scheduling revisited , 2000 .

[5]  Gerhard J. Woeginger,et al.  New lower and upper bounds for on-line scheduling , 1994, Oper. Res. Lett..

[6]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[7]  Gerhard J. Woeginger,et al.  Randomized online scheduling on two uniform machines , 2001, SODA '99.

[8]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[9]  Jirí Sgall,et al.  Preemptive Online Scheduling: Optimal Algorithms for All Speeds , 2006, ESA.

[10]  Gerhard J. Woeginger,et al.  An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..

[11]  György Turán,et al.  On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..

[12]  Yang Yang,et al.  On the optimality of list scheduling for online uniform machines scheduling , 2012, Optim. Lett..

[13]  Jirí Sgall,et al.  A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption , 2011, Theory of Computing Systems.

[14]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[15]  Marek Karpinski,et al.  On-line Load Balancing for Related Machines , 1997, WADS.

[16]  Yossi Azar,et al.  On-Line Load Balancing , 1994, Theor. Comput. Sci..

[17]  Ramaswamy Chandrasekaran,et al.  Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..

[18]  Jirí Sgall,et al.  A lower bound for on-line scheduling on uniformly related machines , 2000, Oper. Res. Lett..

[19]  Tomáš Ebenlendr,et al.  Combinatorial algorithms for online problems: Semi-online scheduling on related machines , 2011 .

[20]  Antoine Musitelli,et al.  Online Scheduling on Three uniform Machines , 2006 .

[21]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[22]  Antoine Musitelli,et al.  Competitive ratio of List Scheduling on uniform machines and randomized heuristics , 2011, J. Sched..