| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-0.xml |
| MD5SUM | da64694dd3ca715594c36c32a8b555a8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 300 |
| Best CPU time to get the best result obtained on this benchmark | 28.1231 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 400 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":400,"count":55}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":3,"count":50},{"degree":6,"count":25}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":1,"count":5},{"arity":2,"count":25},{"arity":3,"count":25},{"arity":5,"count":10},{"arity":7,"count":25}] |
| Number of extensional constraints | 25 |
| Number of intensional constraints | 30 |
| Distribution of constraint types | [{"type":"extension","count":25},{"type":"intension","count":30},{"type":"allDifferent","count":5},{"type":"noOverlap","count":5},{"type":"element","count":25}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 300<instantiation> <list> d[][] sd[][] e[] w[][] s[][] </list> <values> 31 85 44 64 66 7 69 14 68 18 90 74 70 60 1 45 98 76 54 13 80 45 10 91 15 169 234 9 40 125 0 45 171 137 269 90 164 239 299 0 233 0 45 155 287 10 114 159 266 175 300 287 300 300 281 2 3 4 0 1 0 1 3 2 4 4 0 1 2 3 1 2 3 0 4 0 1 2 4 3 9 40 125 169 234 0 45 137 171 269 0 90 164 239 299 0 45 155 233 287 10 114 159 175 266 </values> </instantiation>