Speed Robust Scheduling Supplemental Material

software

posted on 26.12.2021, 10:29 by Franziska Eberle, Ruben HoeksmaRuben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Betrand Simon

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.

History

References

https://arxiv.org/abs/2011.05181

Publisher

4TU.ResearchData

Organizations

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