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).
Title resolution pending
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
Introduces completion-threshold framework yielding first multi-machine deterministic lower bounds of 1.4811 and approaching 3/2 for obligatory-test scheduling, plus a 2-competitive algorithm.
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).
-
The Completion-Threshold Framework for Obligatory-Test Scheduling on Multiple Machines
Introduces completion-threshold framework yielding first multi-machine deterministic lower bounds of 1.4811 and approaching 3/2 for obligatory-test scheduling, plus a 2-competitive algorithm.