11 Scheduling

In this section we will consider examples of scheduling problems. Scheduling in this tutorial means to compute a timetable for tasks competing for a given set of resources. We assume that the execution of a task can not be interrupted (that is, no preemption is allowed).

Christian Schulte and Gert Smolka
Version 1.4.0 (20080702)