Sciweavers

ORL
1998
97views more  ORL 1998»
13 years 11 months ago
Preemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
Jianjun Wen, Donglei Du
MST
2008
157views more  MST 2008»
13 years 11 months ago
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 ...
Leah Epstein, Arik Ganot