Summary

• Constraint programming viable for a class of round robin scheduling problems

• All phases can be solved with constraint programming.

• Friar Tuck: a constraint-based tournament scheduler

• Experience with other tournaments needed.

Previous slide

Back to first slide

View graphic version