A note on on-line scheduling with partial information

We consider a variant of on-line scheduling, where partial information on future jobs is known beforehand. Assume that the last job will be the longest (with the longest execution time). We provide the best possible on-line algorithms with competitive ratios √2 and 3/2, respectively, for m = 2 and 3, where m is the number of machines.