Time-based constraints and costs
ILOG CP supports time-based constraints that allow you to generate optimal schedules with precise activity start-and-stop times. More specifically, it supports:

• precedence constraints as well as minimum and maximum delays between tasks
• periodic breaks in resources utilization
• setup costs
• earliness or tardiness costs
• efficiency curves of resources over time
• breakable or non breakable activities (for instance, to model that a production activity cannot be interrupted)
• continuous activities that produce or consume resources from a finite capacity reservoir

Resource usage constraints that reflect real-world operations
ILOG CP provides resource usage constraints that reflect operational reality, such as the number of docks available to load a truck, the number of machines that can perform a task, the capacity of a tank, or the number employees required. ILOG CP can track resource consumption and reserve resources as well as respect transition times between states—for instance the time required to change a tool on a milling machine.

Specialized routing constraints
ILOG CP supports routing constraints that operationalize travel time, dock time windows, and the distance between various routing options. ILOG CP also supports constraints to model the regulations that are specific to routing problems, such as driver breaks and other work rules.

Specialized constraints for allocation, sequencing and timetabling problems
ILOG CP provides specialized constraints and expressions for sequencing problems, allocation problems and timetabling problems. This includes the “pack” constraint, the “all-different” constraint, the “all-min-distance” constraint, the “lexicographic” constraint, the “count” expression; and “compatibility” and “incompatibility” constraints.