works on
completion time 1lower bounds 1obligatory testing 1online scheduling 1parallel machines 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

cs.DS2026

Hardness of Obligatory-Test Scheduling on Multiple Machines

Kao-Chuan Liang, Ya-Chun Liang

The paper studies online scheduling with obligatory testing on multiple identical machines, establishing new lower bounds on the competitive ratio and presenting a parallel version…