You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Mar 5, 2026. It is now read-only.
Our current representation of priority for a job is, effectively, a time instant.
This works well enough for many scheduling algorithms, but in some cases is insufficient. Notably, it prevents the release! function from specifying anything about how priority ties are broken.
On the overly-flexible end, we could change the priority type to Any. This would allow types such as Tuple to be set as job priorities, so that ties in the first element are broken by subsequent elements.
Or probably better, we could add another type parameter for a job's priority.
Our current representation of priority for a job is, effectively, a time instant.
This works well enough for many scheduling algorithms, but in some cases is insufficient. Notably, it prevents the
release!function from specifying anything about how priority ties are broken.On the overly-flexible end, we could change the priority type to
Any. This would allow types such asTupleto be set as job priorities, so that ties in the first element are broken by subsequent elements.Or probably better, we could add another type parameter for a job's priority.