(Logo)   IMADA
University of Southern Denmark IMADA - Department of Mathematics and Computer Science

Optimal Non-Preemptive Semi-Online Scheduling to Minimize Makespan on Two Related Machines
Lene M. Favrholdt, Leah Epstein
Journal of Algorithms 57(1): 49-73, 2005

We consider the following non-preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines, with the goal of minimizing the makespan. We analyze both the optimal overall competitive ratio, and the optimal competitive ratio as a function of the speed ratio (q>=1) between the two machines. We show that the greedy algorithm LPT has optimal competitive ratio (1 + sqrt(17))/4 (approximately 1.28) overall, but does not have optimal competitive ratio for every value of q. We determine the intervals of q where LPT is an algorithm of optimal competitive ratio, and design different algorithms of optimal competitive ratio for the intervals where it fails to be the best algorithm. As a result, we give a tight analysis of the competitive ratio for every speed ratio.

The publication is available from ScienceDirect (subscription may be required).