| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-9.xml |
| MD5SUM | b1b903d633c720775ef1eb29649a113f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 326 |
| Best CPU time to get the best result obtained on this benchmark | 36.2839 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 426 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":426,"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: 326<instantiation> <list> w[][] s[][] d[][] sd[][] e[] </list> <values> 3 2 1 4 0 0 3 4 2 1 0 4 3 1 2 2 4 1 0 3 1 0 3 2 4 2 50 137 176 236 4 20 122 155 270 18 81 125 173 274 0 50 88 169 245 0 78 169 248 273 17 87 36 59 90 14 99 32 93 56 59 40 44 97 45 50 30 49 67 81 74 91 76 25 53 236 137 50 2 176 4 270 155 20 122 18 173 274 125 81 169 88 0 245 50 78 0 248 169 273 326 326 319 326 326 </values> </instantiation>