Presents deterministic (2.3166) and randomized (2.1523) constant-competitive algorithms for weighted single-machine scheduling with testing, extended via list scheduling to parallel machines (2.7763/2.5110).
Approximation in stochastic scheduling: the power of
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A reduction from stochastic reentrant flow shops to parallel machine scheduling with arrivals yields the first optimality proofs for priority policies on makespan and total completion time, plus an approximation bound for weighted completion time.
citing papers explorer
-
Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model
Presents deterministic (2.3166) and randomized (2.1523) constant-competitive algorithms for weighted single-machine scheduling with testing, extended via list scheduling to parallel machines (2.7763/2.5110).
-
Flow Shop Scheduling with Stochastic Reentry
A reduction from stochastic reentrant flow shops to parallel machine scheduling with arrivals yields the first optimality proofs for priority policies on makespan and total completion time, plus an approximation bound for weighted completion time.