| and (2008) | |||||||||||||||||
Abstract | |||||||||||||||||
| We consider the problem of schedulingpermanent jobs on related machinesin an on-line fashion. We design a new algorithm that achievesthe competitive ratio of ¡£¢¥ ¤ ¦¨§�©� � ¦���¦ for the deterministic version, and ¡� � ¡���������������©�©�§��� � ¡��� � for its randomized variant, improving the previous competitive ratios of 8 and ����§�©� � ��¡� �. We also prove lower bounds of �� � ��¡�¦� � on the competitive ratio of deterministic algorithms and �� � ¦�¡��� � on the competitive ratio of randomized algorithms for this problem. | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||