The Abramson-15-problem, belongs to the set of Abramson-N-problems.
These artificial problems all have a timeframe of 30 periods.
The events are built by first choosing a random teacher and class and room identifiers
and then placing that lecture in the first possible period.
If the lecture cannot be placed in an available period, then it is discarded and another one is generated.
This process continues until all teacher, class and room identifiers have been used.
Consequently all teachers, classes and rooms are 30 times busy (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 |
30 |
15 |
15 |
- |
15 |
450 |
450 |
The following constraints are present:
- Scheduling constraints: AssignTimeConstraint.
- Event constraints: -
- Resource constraints: AvoidClashesConstraint.
The following solution is submitted for this instance:
|
SolutionGroup |
Feasibility value |
Objective value |
Submitted by |
Received |
|
MichaelPimmer_2010-12-03 |
3 |
0 |
Michael Pimmer |
December 3, 2010 |
|
CimmoJari_2011-05-31 |
0 |
0 |
Cimmo Nurmi and Jari Kyngäs |
June 16, 2011 |
XML file
ArtificialAbramson15.xml (instance and solutions)
previous versions:
ArtificialAbramson15.xml (XHSTT2012A)
[Update to 2014: cost function simplified.]
ArtificialAbramson15.xml (XHSTT2011A)
[Update to 2012: aesthetic changes.]
ArtificialAbramson15.xml (XHSTT2010A)
[Update to 2011:
Removed all superfluous constraints.
Throughout renamed "SchoolClass" to "Class".]