Library Header Image
LSE Research Online LSE Library Services

Speed-robust scheduling: sand, bricks, and rocks

Eberle, Franziska, Hoeksma, Ruben, Megow, Nicole, Nölke, Lukas, Schewior, Kevin and Simon, Bertrand (2023) Speed-robust scheduling: sand, bricks, and rocks. Mathematical Programming: A Publication of the Mathematical Optimization Society, 197 (2). 1009 - 1048. ISSN 0025-5610

[img] Text (speed) - Accepted Version
Download (792kB)

Identification Number: 10.1007/s10107-022-01829-0


The speed-robust scheduling problem is a two-stage problem where, given m machines, jobs must be grouped into at most m bags while the processing speeds of the 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 2-1m for the most general setting and improve this to 1.8 for equal-size jobs. For the special case of infinitesimal jobs, we give an algorithm with an optimal robustness factor equal to ee-1≈1.58. The particular machine environment in which all machines have either speed 0 or 1 was studied before by Stein and Zhong (ACM Trans Algorithms 16(1):1-20, 2020. For this setting, we provide an algorithm for scheduling infinitesimal jobs with an optimal robustness factor of 1+22≈1.207. It lays the foundation for an algorithm matching the lower bound of 43 for equal-size jobs.

Item Type: Article
Official URL:
Additional Information: © 2022, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 18 Jul 2022 10:54
Last Modified: 08 Apr 2024 20:51

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics