The Parameterized Scheduling Zoo
An interactive browser for scheduling complexity results, built on The Scheduling Zoo. Explore related problems, follow reductions, and identify open questions.
Open the Zoo → Source on GitHub
What you can do
- Browse the Scheduling Zoo. Filter problems in Graham’s three-field notation α | β | γ, and follow reductions between them.
- Design problem maps. Build your own map of related problems and export it as TikZ.
- Look up results per parameter. Explore recorded tractability and hardness results by parameter, with references. Missing entries may reflect gaps in the dataset.
- Contribute results. Propose classifications and reductions, then submit them using “Send my classifications”.
Work in progress. The parameterized results are an early seed dataset and are still being checked. If you find a missing result, a wrong classification, or a better reference, please email me or open an issue.
I’m developing the Zoo into a shared reference for scheduling complexity. Contributions of results, references, and corrections are welcome. If you would like to collaborate, email me.
Acknowledgements
The overview map is built from The Scheduling Zoo’s bibliography and notation files, © Christoph Dürr, used under the MIT License.