Speed Robust Scheduling Supplemental Material
Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B.
(2021).
Speed Robust Scheduling Supplemental Material.
[Dataset]. 4TU.ResearchData.
https://doi.org/10.4121/17159216
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.
| Item Type | Dataset |
|---|---|
| Publisher | 4TU.ResearchData |
| DOI | 10.4121/17159216 |
| Date made available | 26 December 2021 |
| Keywords | combinatorial optimization, computer assisted proof, data structures, scheduling algorithms |
| Resource language | Other |
| Departments |
LSE > Academic Departments > Mathematics LSE |
Explore Further
- Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B. (2023). Speed-robust scheduling: sand, bricks, and rocks. Mathematical Programming: A Publication of the Mathematical Optimization Society, 197(2), 1009 - 1048. https://doi.org/10.1007/s10107-022-01829-0 (Repository Output)
- https://arxiv.org/abs/2011.05181
Downloads