Czech Village School was provided by Martin Klemsa; it was exported from the timetabling system Skolaris.
A summary of the data can be found in the following table:
|
Assets |
Times |
Teachers |
Rooms |
Students |
Classes |
# events |
Total duration |
|
value |
30 |
8 |
- |
- |
6 |
67 |
68 |
The following constraints are present:
- Scheduling constraints: AssignTimeConstraint, SplitEventsConstraint.
- Event constraints: PreferTimesConstraint and SpreadEventsConstraint.
- Resource constraints: AvoidClashesConstraint, AvoidUnavailableTimesConstraint, LimitIdleTimesConstraint, LimitBusyTimesConstraint, and ClusterBusyTimesConstraint.
According to the following argument (provided by Martin as well), the lower bound is 10: a penalty of 5 for course spread "4.5.B_CJ" is inevitable, because the events' teacher is not available on the day. A combined penalty of 5 for unavailable times is also inevitable, because the classes have five more events than fit into the fully available slots.
Wiesław Dudek reports a lowerbound of 13, so the solutions below are all optimal.
|
SolutionGroup |
Objective value |
Lowerbound |
Submitted by |
Received |
|
Skolaris_2018-10-08 |
13 |
10 |
Martin Klemsa |
October 8, 2018 |
|
Dudek Timetables 2022 |
13 |
13 |
Wiesław Dudek |
September 12, 2022 |