The paper proves asymptotically optimal competitive ratios for four online scheduling settings with known setup times and unknown execution times, from Θ(m) and Θ(n^{1/3}) down to Θ(log n / log log n).
Title resolution pending
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Scheduling on Identical Machines with Setup Time and Unknown Execution Time
The paper proves asymptotically optimal competitive ratios for four online scheduling settings with known setup times and unknown execution times, from Θ(m) and Θ(n^{1/3}) down to Θ(log n / log log n).