Participants could participate in any number of rounds. The dates that were important for the competition are:
October 1, 2011. Start of the competition.
January 1, 2012. Official release of XHSTT-2012.
These instances were used for the first part of the competition. Like all other instances these instance are in XHSTT (XML). For a short introduction to XHSTT we refer to the XHSTT tutorial.
January 1, 2012. Release of XHSTT-ITC2011.
XHSTT-ITC2011 were a subset of instances in XHSTT-2012 used for the second part of the competition. XHSTT-2012 uses all documented constraints, while XHSTT-ITC2011 contained no constraints of the types "AvoidSplitAssignmentsConstraint" and "LimitWorkloadConstraint".
January 1, 2012 - May 7, 2012. Submission of all-time-best-solutions.
This was the first round of the competition. The submitted solutions should be better than the instance contributor's solution. In case of ties, the earliest received solution wins.
May 7, 2012. Submission of benchmarked solutions to XHSTT-ITC2011.
Based on rank scores, the organizers selected 4 participants as finalists to the second round of the competition. They asked the finalists for executables of their programs, and ran them on the hidden instances. The ranking of the finalists was by rank score on these hidden instances, see ordering.
June 1, 2012. For finalists of the second round only: paper submission.
Submission of a short paper with a description of the methods used. Each finalist must submit a short paper, explaining the methods used. If indicated this paper proceeded as a contribution to PATAT 2012 as well.
June 11, 2012. Release of the hidden instances.
The hidden instances were used in the third round of the competition. They are collected in archive XHSTT-ITC2011-hidden.
July 11, 2012. Submission of solutions to XHSTT-ITC2011-hidden.