Speed Robust Scheduling Supplemental Material

doi: 10.4121/17159216.v1
The doi above is for this specific version of this dataset, which is currently the latest. Newer versions may be published in the future. For a link that will always point to the latest version, please use
doi: 10.4121/17159216
Datacite citation style:
Franziska Eberle; Hoeksma, Ruben; Nicole Megow; Nölke, Lukas; Schewior, Kevin et. al. (2021): Speed Robust Scheduling Supplemental Material. Version 1. 4TU.ResearchData. software. https://doi.org/10.4121/17159216.v1
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
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.
  • 2021-12-26 first online, published, posted
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


files (6)