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).

• 11.1 Building a House
  • Problem Specification
  • 11.1.1 Building a House: Precedence Constraints
    • Model
    • Distribution Strategy
    • Script
  • 11.1.2 Building a House: Capacity Constraints
    • Model
    • Distribution Strategy
    • Script
  • 11.1.3 Building a House: Serializers
    • Ordering Tasks by Distribution
    • Script

• 11.2 Constructing a Bridge
  • Problem Specification
  • Model
  • Distribution Strategy
  • Script

• 11.3 Strong Propagators for Capacity Constraints

• 11.4 Strong Serializers

• 11.5 Solving Hard Scheduling Problems
  • 11.5.1 The Problem ABZ6
  • 11.5.2 The MT10 Problem