All15

All15

The all-15-problem, belongs to the set of all-N-problems. These artificial problems have a timeframe of N days with N periods in one day totaling NxN periods. There are N teachers, N classes and N rooms. All possible combinations of a teacher, a class and a room are to be scheduled. This will give us N*N*N lectures to be scheduled. Like the Abramson cases, all resources have full schedules. This dataset was created by and converted to XHSTT by Cimmo Nurmi and Jari Kyngäs.


A summary of the data can be found in the following table:

Assets

Times

Teachers

Rooms

Students

Classes

# events

Total duration

value

225

15

15

-

15

3375

3375

The following constraints are present:
  • Scheduling constraints: AssignTimeConstraint.
  • Event constraints: -
  • Resource constraints: AvoidClashesConstraint.

XML file

ArtificialAll15.xml (instance)


previous versions:

ArtificialAll15.xml (XHSTT2011A)
[Update to 2014: cost function simplified.]

ArtificialAll15.xml (XHSTT2010)
[Update to 2011:
Removed superfluous constraints.
Throughout renamed "SchoolClass" to "Class".]