Sciweavers

Share
201 search results - page 1 / 41
» Preemptive Scheduling with Rejection
Sort
View
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
9 years 2 months ago
Preemptive Scheduling with Rejection
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...
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
9 years 2 months ago
Online real-time preemptive scheduling of jobs with deadlines
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
ORL
1998
97views more  ORL 1998»
8 years 10 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»
8 years 10 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
DM
2000
103views more  DM 2000»
8 years 10 months ago
Feasible edge colorings of trees with cardinality constraints
A variation of preemptive open shop scheduling corresponds to
Dominique de Werra, Alain Hertz, Daniel Kobler, Na...
books