ORL
1998
14 years 3 days ago
1998
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
MST
2008
14 years 12 days ago
2008
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 ...