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.
Improved approximation algorithms for multiprocessor scheduling with testing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.