Constraint Programming for Scheduling

Define constraint satisfaction and constraint optimization problems.

Model a job shop scheduling problem using interval variables and temporal constraints.

Apply global constraints (e.g., NoOverlap, Cumulative) for resource modeling.

Explain the role of constraint propagation and domain reduction in solving.

Implement a CP model for the standard job shop problem.

Extend a CP model to solve the FJSP by incorporating alternative interval variables.

Compare the strengths and weaknesses of CP and MILP for modeling and solving scheduling problems.