cff-version: 1.2.0
abstract: "<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>"
authors:
  - family-names: Eberle
    given-names: Franziska
  - family-names: Hoeksma
    given-names: Ruben
    orcid: "https://orcid.org/0000-0002-6553-7242"
  - family-names: Megow
    given-names: Nicole
  - family-names: Nölke
    given-names: Lukas
  - family-names: Schewior
    given-names: Kevin
  - family-names: Simon
    given-names: Betrand
title: "Speed Robust Scheduling Supplemental Material"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/17159216.v1
license: CC BY 4.0
date-released: 2021-12-26