ConceptTheory & Algos
Non-identical machines scheduling
A task scheduling problem variant where resources or machines are non-identical and each request can only run on a specified subset of available machines.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.