Scheduling

Describes how to model scheduling problems in OPL.

Introduction
OPL and CP Optimizer introduce a set of modeling features for applications that deal with scheduling over time.
Piecewise linear and stepwise functions
Describes piecewise linear and stepwise functions as related to scheduling.
Interval variables
Describes a basic building block of scheduling, the interval.
Unary constraints on interval variables
CP Optimizer provides constraints for modeling restrictions that an interval cannot start, cannot end or cannot overlap a set of fixed dates.
Precedence constraints between interval variables
Precedence constraints are common scheduling constraints used to restrict the relative position of interval variables in a solution.
Constraints on groups of interval variables
Describes constraints that act to encapsulate a group of intervals together.
A logical constraint between interval variables: presenceOf
The presence constraint states that a certain interval must be present in the solution.
Expressions on interval variables
Integer and numerical expressions are available to access or evaluate different attributes of an interval variable.
Sequencing of interval variables
Describes a basic building block of scheduling, the interval sequence.
Cumulative functions
Describes the cumulative function.
State functions
Describes the state function.
Notation
The main types of notation used throughout the scheduling section are defined here.

Parent topic: OPL, the modeling language