Speed Robust Scheduling Supplemental Material
Franziska Eberle
Ruben Hoeksma
Nicole Megow
Lukas NĂ¶lke
Kevin Schewior
Betrand Simon
Scheduling algorithms
Computer assisted proof
Data Structures
Combinatorial optimization
<div>This supplemental material proves two claims of the main paper named "Speed-Robust Scheduling". It provides a Mathematica sheet and its output, proving the last claim of Lemma 11; a Python script used to certify that for the relevant values of number of machines and unit-size jobs, there exists a 4/3-robust solution (Lemma 15); a compressed data file containing the input of the script check.py; a file with human-readable data.</div>
4TU.ResearchData
London School of Economics and Political Science, Department of Mathematics, Operations Research
University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science, Chair of Discrete Mathematics and Mathematical Programming
University of Bremen, Faculty of Mathematics and Computer Science, Combinatorial Optimization and Logistics Group
University of Cologne, Department of Mathematics and Computer Science
IN2P3 Computing Center / CNRS, CCLab
2021-12-26
software
10.4121/17159216.v1
en
CC BY 4.0