Lukas' Notes

computation scheduling

Definition

Feasible Schedule

A feasible schedule is a schedule that satisfies all constraints of the interval scheduling instance.
It is the scheduling-specific form of a feasible solution.

Conditions

For a single machine, feasibility requires selected intervals to be pairwise non-overlapping. For multiple machines, feasibility requires pairwise non-overlap only among intervals assigned to the same machine.

Additional constraints, such as release times, deadlines, and precedence constraints, must also be satisfied when they are part of the instance.