Sciweavers

ORL
2002
81views more  ORL 2002»
13 years 11 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
Leah Epstein, John Noga, Gerhard J. Woeginger
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
JDA
2008
93views more  JDA 2008»
13 years 11 months ago
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochu...
ESA
2007
Springer
131views Algorithms» more  ESA 2007»
14 years 5 months ago
Online Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de
Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, G...