Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as functions of the machine speeds.

• Type: Journal
• Year: 2008
• Where: MST
• Authors: Leah Epstein, Arik Ganot
• Keywords: Algorithms, MST 2008, On-line Scheduling, Preemptive On-line Scheduling