Search Sciweavers | Sciweavers

192 search results - page 1 / 39

» Preemptive Scheduling with Rejection

click to vote

ESA
2000
Springer

141views Algorithms» more ESA 2000»

Preemptive Scheduling with Rejection

13 years 8 months ago

Download www.math.tu-berlin.de

We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...

Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...

claim paper

Read More »

click to vote

APPROX
2000
Springer

107views Algorithms» more APPROX 2000»

Online real-time preemptive scheduling of jobs with deadlines

13 years 8 months ago

Download www.cs.uic.edu

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...

Bhaskar DasGupta, Michael A. Palis

claim paper

Read More »

click to vote

MST
2008

157views more MST 2008»

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

13 years 4 months ago

Download math.haifa.ac.il

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

claim paper

Read More »

click to vote

ORL
1998

97views more ORL 1998»

Preemptive on-line scheduling for two uniform processors

13 years 4 months ago

Download v8nu74s71s31g374r7ssn017uloss3c1vr3s.unbf.ca

This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the

Jianjun Wen, Donglei Du

claim paper