Expand description
Scheduling algorithms and constraints
This module provides scheduling primitives that can be used with constraint solvers or standalone heuristics.
§Concepts
- Interval: A task with start, duration, and end
- Disjunctive: Tasks that cannot overlap (single resource)
- Cumulative: Tasks sharing resource capacity
Structs§
- Interval
- An interval (task) in a schedule
- Scheduled
Interval - A scheduled interval (with assigned start time)
- Scheduling
Problem - A scheduling problem
- Scheduling
Solution - Solution to a scheduling problem
Functions§
- list_
schedule - Simple list scheduling heuristic for disjunctive problems