2 research outputs found
Speed-Robust Scheduling
The speed-robust scheduling problem is a two-stage problem where given
machines, jobs must be grouped into at most bags while the processing
speeds of the given machines are unknown. After the speeds are revealed,
the grouped jobs must be assigned to the machines without being separated. To
evaluate the performance of algorithms, we determine upper bounds on the
worst-case ratio of the algorithm's makespan and the optimal makespan given
full information. We refer to this ratio as the robustness factor. We give an
algorithm with a robustness factor for the most general setting and
improve this to for equal-size jobs. For the special case of
infinitesimal jobs, we give an algorithm with an optimal robustness factor
equal to . The particular machine environment in which
all machines have either speed or was studied before by Stein and Zhong
(SODA 2019). For this setting, we provide an algorithm for scheduling
infinitesimal jobs with an optimal robustness factor of . It lays the foundation for an algorithm matching the lower bound of
for equal-size jobs